An Extremal Problem For Edge Domination Insensitive Graphs
Abbreviated Journal Title
Discret Appl. Math.
A connected graph is edge domination insensitive if the domination number is unchanged when any single edge is removed. The minimum number of edges required by such a graph is determined. Similar results are given when the graph must remain connected upon any edge's removal and when the dominating set must remain fixed.
Discrete Applied Mathematics
Dutton, Ronald D. and Brigham, Robert C., "An Extremal Problem For Edge Domination Insensitive Graphs" (1988). Faculty Bibliography 1980s. 623.