Connected and outer-connected domination number of middle graphs
Combinatorics
2022-07-01 v1
Abstract
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph M(G). We also compute the outer-connected domination number of some families of graphs such as star graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and some operation on graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the outer-connected domination number of middle graphs.
Cite
@article{arxiv.2206.15439,
title = {Connected and outer-connected domination number of middle graphs},
author = {Farshad Kazemnejad and Behnaz Pahlavsay and Elisa Palezzato and Michele Torielli},
journal= {arXiv preprint arXiv:2206.15439},
year = {2022}
}