Changing and unchanging isolate domination: Edge removal
S. Balamurugan · Discrete Mathematics Algorithms and Applications · 2016
A set of [Formula: see text] of vertices in a graph [Formula: see text] is called a dominating set if every vertex of [Formula: see text] is adjacent to an element of [Formula: see text]. Further, if [Formula: see text] has an isolated vertex, then [Formula: see text] is called an isolate dominating set. The minimum cardinality of an isolate dominating set of a graph [Formula: see text] is called the isolate domination number, denoted by [Formula: see text]. This paper examines the effects of removal of an edge on the isolate domination number of a graph.