Abstract
A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G is bounded above by twice the domination number of G. We give a constructive characterization of the trees attaining this bound.
| Original language | English |
|---|---|
| Pages (from-to) | 3-12 |
| Number of pages | 10 |
| Journal | Utilitas Mathematica |
| Volume | 71 |
| Publication status | Published - Nov 2006 |
| Externally published | Yes |
Keywords
- Domination
- Paired-domination
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
- Applied Mathematics