2014/07/19 by William F. Klostermeyer, Klostermeyer, William F., Christina M. Mynhardt +1 · 1 citation
Mathematics · #05C69 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C69
paper · pdf · doi:10.48550/arxiv.1407.5228
29 pages, two figures, survey
arxiv created 2015/04/02 · arxiv updated 2015/04/03
Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed. In this survey we describe a number of these models with particular attention to the case when the attack sequence is infinitely long and the guards must induce some particular configuration before each attack, such as a dominating set or a vertex cover. Results from the literature concerning the number of guards needed to successfully defend a graph in each of these problems are surveyed.