Abstract
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G. In this paper, we present several upper bounds on the total domination number in terms of the minimum degree, diameter, girth and order.
| Original language | English |
|---|---|
| Pages (from-to) | 243-256 |
| Number of pages | 14 |
| Journal | Ars Combinatoria |
| Volume | 91 |
| Publication status | Published - Apr 2009 |
| Externally published | Yes |
Keywords
- Diameter
- Girth
- Minimum degree
- Total domination
ASJC Scopus subject areas
- General Mathematics