Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Foolproof eternal domination in the all-guards move model

In: Mathematica Slovaca, vol. 62, no. 4
William F. Klostermeyer - Gary Macgillivray
Detaily:
Rok, strany: 2012, 595 - 610
Kľúčové slová:
dominating sets, eternal domination, eternal security, eternal vertex cover, graph protection
O článku:
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.
Ako citovať:
ISO 690:
Klostermeyer, W., Macgillivray, G. 2012. Foolproof eternal domination in the all-guards move model. In Mathematica Slovaca, vol. 62, no.4, pp. 595-610. 0139-9918. DOI: https://doi.org/10.2478/s12175-012-0033-x

APA:
Klostermeyer, W., Macgillivray, G. (2012). Foolproof eternal domination in the all-guards move model. Mathematica Slovaca, 62(4), 595-610. 0139-9918. DOI: https://doi.org/10.2478/s12175-012-0033-x
O vydaní:
Publikované: 1. 8. 2012