Partitioning the vertices of a graph into two total dominating sets
| Autor: | Teresa W. Haynes, Wyatt J. Desormeaux, Pamela I Delgado |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
010102 general mathematics Neighbourhood (graph theory) 0102 computer and information sciences 01 natural sciences Total domination vertex partitions dominating sets self-complementary graphs Combinatorics Mathematics (miscellaneous) 010201 computation theory & mathematics Graph power Dominating set Independent set Frequency partition of a graph Wheel graph Feedback vertex set Regular graph 0101 mathematics Mathematics |
| Zdroj: | Quaestiones Mathematicae; Vol 39, No 7 (2016); 863-873 |
| ISSN: | 1607-3606 1727-933X |
| Popis: | A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjacent to a vertex of S. We study graphs whose vertex set can be partitioned into two total dominating sets. In particular, we develop several sufficient conditions for a graph to have a vertex partition into two total dominating sets. We also show that with the exception of the cycle on five vertices, every self-complementary graph with minimum degree at least two has such a partition.Mathematics Subject Classification (2010): 05C69.Keywords: Total domination, vertex partitions, dominating sets, self-complementary graphs |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|