ISOLATE DOMINATION IN THE CLASS OF UNICYCLIC GRAPHS
Abstract
A subset $D$ of the vertex set $V$ of a graph $G$ is called a dominating set of $G$ if every vertex in $V-D$ is adjacent to a vertex in $D$. A dominating set $D$ such that $< D >$ has an isolated vertex is called an isolate dominating set and the minimum cardinality of an isolate dominating set is called the isolate domination number of $G$ and is denoted by $\gamma_{0}(G)$. In this work, we investigate an isolate domination number for unicyclic graphs in the context of various transformations.
Keywords
References
- [1] Sahul Hamid, I. and Balamurugan, S., (2013), Isolate Domination in Unicyclic Graphs, International Journal of Mathematics and Soft Computing, 3(3), pp. 79-83.
- [2] Sahul Hamid, I. and Balamurugan, S., (2016), Isolate Domination in Graphs, Arab Journal of Mathematical Sciences, 22, pp. 232-241.
- [3] Haynes, T. W., Hedetniemi, S. T. and Slater, P. J., (1998), Fundamentals of Domination in Graphs, Marcel Dekker Inc., New York.
- [4] Haynes, T. W., Hedetniemi, S. T. and Slater, P. J., (1998), Domination in Graphs (Advanced Topics), Marcel Dekker Inc., New York.
- [5] Manian, Mohammad Ali, Heidarian, Shahram and Haghani, Farhad Khaksar, (2023), Maximum and Minimum Values of Inverse Degree and Forgotten Indices on the Class of all Unicyclic Graphs, AKCE International Journal of Graphs and Combinatorics, 20(1), pp. 57-60.
- [6] West, D. B., (2006), Introduction to Graph Theory, Prentice-Hall of India Pvt. Ltd.
Details
Primary Language
English
Subjects
Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics)
Journal Section
Research Article
Publication Date
September 7, 2026
Submission Date
May 19, 2025
Acceptance Date
October 7, 2025
Published in Issue
Year 2026 Volume: 16 Number: 9