Abstract
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a total dominating set of a graph is a set of vertices such that every vertex is adjacent to a vertex in the set. In this paper, we provide a constructive characterization of graphs whose vertex set can be partitioned into a dominating set and a total dominating set.
| Original language | English |
|---|---|
| Pages (from-to) | 119-129 |
| Number of pages | 11 |
| Journal | Quaestiones Mathematicae |
| Volume | 32 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Mar 2009 |
| Externally published | Yes |
Keywords
- Domination
- Total domination
- Vertex partition
ASJC Scopus subject areas
- Mathematics (miscellaneous)