University of IsfahanTransactions on Combinatorics2251-865712220230601Domination number of middle graphs79912663810.22108/toc.2022.131151.1927ENFarshadKazemnejadDepartment of Mathematics, School of Sciences, Ilam University, P.O.Box 69315-516, Ilam, Iran.BehnazPahlavsayDepartment of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.ElisaPalezzatoDepartment of Mathematics, Hokkaido University, Kita 10, Nishi 8, Kita-Ku, Sapporo 060-0810, Japan.MicheleTorielliHokkaido University, Department of MathematicsJournal Article20211023In 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.https://toc.ui.ac.ir/article_26638_a7b1e622bfa064e433c9ef552f5757e0.pdf