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.
