Abstract
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 note, we show that the vertex set of every graph with minimum degree at least two and with no component that is a 5-cycle can be partitioned into a dominating set and a total dominating set.
| Original language | English |
|---|---|
| Pages (from-to) | 159-162 |
| Number of pages | 4 |
| Journal | Ars Combinatoria |
| Volume | 89 |
| Publication status | Published - Oct 2008 |
| Externally published | Yes |
Keywords
- Domination
- Total domination
- Vertex partition
ASJC Scopus subject areas
- General Mathematics