Partitioning the Vertices of a Graph into Two Total Dominating Sets
Document Type
Article
Publication Date
11-4-2016
Description
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 selfcomplementary graph with minimum degree at least two has such a partition.
Citation Information
Delgado, Pamela; Desormeaux, Wyatt J.; and Haynes, Teresa W.. 2016. Partitioning the Vertices of a Graph into Two Total Dominating Sets. Quaestiones Mathematicae. Vol.39(7). 863-873. https://doi.org/10.2989/16073606.2016.1188862 ISSN: 1607-3606