Domination number of middle graphs

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

Full description

Bibliographic Details
Main Authors: Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli
Format: Article
Language:English
Published: University of Isfahan 2023-06-01
Series:Transactions on Combinatorics
Subjects:
Online Access:https://toc.ui.ac.ir/article_26638_a7b1e622bfa064e433c9ef552f5757e0.pdf