A Dynamic Domination Problem
A dynamic domination problem in graphs is studied in which an innite sequence of attacks occurs at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex. Other guards are allowed to move at the same time, and before and after each attack, the vertices containing guards must form a dominating set. We are concerned with the minimum number of guards required to achieve this goal against any arbitrary sequence of attacks; this number is called the swap number. The swap number lies between the domination and independence numbers of the graph; bounds for some classes of graphs are examined in this paper.
Journal of Discrete Mathematical Sciences and Cryptography
Digital Object Identifier (DOI)
Klostermeyer. (2015). A Dynamic Domination Problem. Journal of Discrete Mathematical Sciences & Cryptography, 18(6), 837–848. https://doi.org/10.1080/09720529.2015.1026457