Domination, Eternal Domination, and Clique Covering
Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 2, pp. 283-300
Voir la notice de l'article provenant de la source Library of Science
Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-eternal domination model. Inequality chains consisting of the domination, eternal domination, m-eternal domination, independence, and clique covering numbers of graph are explored in this paper.
Among other results, we characterize bipartite and triangle-free graphs with domination and eternal domination numbers equal to two, trees with equal m-eternal domination and clique covering numbers, and two classes of graphs with equal domination, eternal domination and clique covering numbers.
Keywords:
dominating set, eternal dominating set, independent set, clique cover
@article{DMGT_2015_35_2_a7,
author = {Klostermeyer, William F. and Mynhardt, C.M.},
title = {Domination, {Eternal} {Domination,} and {Clique} {Covering}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {283--300},
publisher = {mathdoc},
volume = {35},
number = {2},
year = {2015},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2015_35_2_a7/}
}
TY - JOUR AU - Klostermeyer, William F. AU - Mynhardt, C.M. TI - Domination, Eternal Domination, and Clique Covering JO - Discussiones Mathematicae. Graph Theory PY - 2015 SP - 283 EP - 300 VL - 35 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2015_35_2_a7/ LA - en ID - DMGT_2015_35_2_a7 ER -
Klostermeyer, William F.; Mynhardt, C.M. Domination, Eternal Domination, and Clique Covering. Discussiones Mathematicae. Graph Theory, Tome 35 (2015) no. 2, pp. 283-300. http://geodesic.mathdoc.fr/item/DMGT_2015_35_2_a7/