Extremal Graphs Domination Insensitive To The Removal Of K-Edges
Title - Alternative
Discret Appl. Math.
A connected graph G with order p is defined to be gamma(k)-insensitive if the domination number gamma(G) is unchanged when an arbitrary set of k edges is removed. The problem of finding the least number of edges in any such graph has been solved for k=1. We determine bounds on this minimum number which are valid for any p and for k greater-than-or-equal-to 2.
Discrete Applied Mathematics
Haynes, T. W.; Brigham, R. C.; and Dutton, R. D., "Extremal Graphs Domination Insensitive To The Removal Of K-Edges" (1993). Faculty Bibliography. 1697.