• ABOUT ISOLATE DOMINATION IN GRAPHS
Abstract
In this paper we further study isolate domination in graphs. In particular we study the effect of removing an isolated vertex from the graph on the isolate domination number of the graph. We prove a necessary and sufficient condition under which the isolate domination number increases when an isolated vertex is remove from the graph. Further we also prove a necessary and sufficient condition under which the isolate domination number decreases when an isolated vertex is remove from the graph. It follows that if a graph has an isolated vertex then is the only isolated vertex of the graph .For a non isolated vertex of a graph, we prove similar results.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |