- Tytuł:
- Partitioning a graph into a dominating set, a total dominating set, and something else
- Autorzy:
-
Henning, Michael
Löwenstein, Christian
Rautenbach, Dieter - Powiązania:
- https://bibliotekanauki.pl/articles/744065.pdf
- Data publikacji:
- 2010
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
domination
total domination
domatic number
vertex partition
Petersen graph - Opis:
- A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominating set, Ars Comb. 89 (2008), 159-162) implies that every connected graph of minimum degree at least three has a dominating set D and a total dominating set T which are disjoint. We show that the Petersen graph is the only such graph for which D∪T necessarily contains all vertices of the graph.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2010, 30, 4; 563-574
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł