Domination number of middle graphs
نویسندگان
1 Department of Mathematics, School of Sciences, Ilam University, P.O.Box 69315-516, Ilam, Iran.
2 Department of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.
3 Department of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.
4 Hokkaido University, Department of Mathematics
doi
10.22108/toc.2022.131151.1927چکیده
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.
