Eternal domination on 3 × n grid graphs
Stephen Finbow, Margaret-Ellen Messinger, Martin F. van Bommel · Australas. J Comb. · 2015
In the eternal dominating set problem, guards form a dominating set on a graph and at each step, a vertex is attacked. After each attack, if the guards can “move” to form a dominating set that contains the attacked vertex, then the guards have successfully defended against the attack. We wish to determine the minimum number of guards required to successfully defend against any possible sequence of attacks, the eternal domination number. Since the domination number for grid graphs has been recently deter• • • • •