Abstract
Let G = (V,E) be a graph without isolated vertices. A set S ⊆ V is a total dominating set if every vertex in V is adjacent to at least one vertex in S. A total dominating set S ⊆ V is a paired-dominating set if the induced subgraph G[S] has at least one perfect matching. The paired-domination number γpr(G) is the minimum cardinality of a paired-domination set of G. In this paper, we provide a constructive characterization of those trees with equal total domination and paired-domination numbers, and of those trees for which the paired domination number is twice the matching number.
| Original language | English |
|---|---|
| Pages (from-to) | 31-39 |
| Number of pages | 9 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 30 |
| Publication status | Published - 2004 |
| Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics