Total domination number of middle graphs

Total domination number of middle graphs

<p>A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set. </p><p>In this paper, we study the total...

Full description

Bibliographic Details
Main Authors: Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2022-04-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
total domination number, middle graph, nordhaus-gaddum-like relation
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/1227

Internet

https://www.ejgta.org/index.php/ejgta/article/view/1227

Similar Items