- Tytuł:
- Domination, Eternal Domination, and Clique Covering
- Autorzy:
-
Klostermeyer, William F.
Mynhardt, C.M. - Powiązania:
- https://bibliotekanauki.pl/articles/31339487.pdf
- Data publikacji:
- 2015-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
dominating set
eternal dominating set
independent set
clique cover - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 283-300
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł