Title of article :
DOMINATION NUMBER OF MIDDLE GRAPHS
Author/Authors :
Kazemnejad ، Farshad Department of Mathematics - School of Sciences - Ilam University , Pahlavsay ، Behnaz Department of Mathematics - Hokkaido University , Palezzato ، Elisa Department of Mathematics - Hokkaido University , Torielli ، Michele Department of Mathematics - Hokkaido University
Abstract :
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs.
Keywords :
Domination number , Middle graph , Nordhaus , Gaddum , like relation
Journal title :
Transactions on Combinatorics
Journal title :
Transactions on Combinatorics
