We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at the vertices of G which can be defended in such a way that an eternal dominating set not containing v is reached. The study of the stronger assertion that such a set can be reached after a single attack is defended leads to the study of graphs which are critical in the sense that deleting any vertex reduces the eternal domination number. Examples of these graphs and tight bounds on connectivity, edge-connectivity and diameter are given. It is also shown that there exist graphs in which deletion of any edge increases the eternal domination number, and graphs in which addition of any edge decreases the eternal domination number.
@article{bwmeta1.element.doi-10_7151_dmgt_1918,
author = {William F. Klostermeyer and Gary MacGillivray},
title = {Eternal Domination: Criticality and Reachability},
journal = {Discussiones Mathematicae Graph Theory},
volume = {37},
year = {2017},
pages = {63-77},
zbl = {1354.05108},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1918}
}
William F. Klostermeyer; Gary MacGillivray. Eternal Domination: Criticality and Reachability. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 63-77. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1918/