Domination number of middle graphs

DOI10.22108/TOC.2022.131151.1927MaRDI QIDQ6346644arXivFDO

Authors Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli

Publication date 6 August 2020

Published in arXiv

Full work available at URL https://doi.org/10.22108/TOC.2022.131151.1927

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

arXiv classification

math.CO

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. 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.

This page was built for publication: Domination number of middle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6346644)