Extremal Graphs Domination Insensitive to the Removal of K Edges
Document Type
Article
Publication Date
7-19-1993
Description
A connected graph G with order p is defined to be γk-insensitive if the domination number γ(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 ≥ 2.
Citation Information
Haynes, Teresa W.; Brigham, Robert C.; and Dutton, Ronald D.. 1993. Extremal Graphs Domination Insensitive to the Removal of K Edges. Discrete Applied Mathematics. Vol.44(1-3). 295-304. https://doi.org/10.1016/0166-218X(93)90238-J ISSN: 0166-218X
