The eternal domination problem requires a graph be protected against an infinitely long sequence of attacks at vertices, by guards located at vertices, with the requirement that the configuration of guards induces a dominating set at all times. An attack is defended by sending a guard from a neighboring vertex to the attacked vertex. We allow all guards to move to neighboring vertices in response to an attack, but allow the attacked vertex to choose which neighboring guard moves to the attacked vertex. This is the all-guards move version of the “foolproof” eternal domination problem that has been previously studied. We present some results and conjectures on this problem.
Contents
-
July 18, 2012
-
Open AccessA representation of weak effect algebrasJuly 18, 2012
-
July 18, 2012
-
July 18, 2012
-
Open AccessTopological systems and Artin glueingJuly 18, 2012
-
July 18, 2012
-
Open AccessAnti-periodic solutions of nonlinear first order impulsive functional differential equationsJuly 18, 2012
-
July 18, 2012
-
July 18, 2012
-
Open AccessElimination of the type B uncertaintyJuly 18, 2012
-
July 18, 2012
-
July 18, 2012
-
July 18, 2012