Abstract
Let G = (V, E) be a graph without isolated vertices. A set D ⊆ V is a paired-dominating set if D is a dominating set of G and the induced subgraph G[D] has a perfect matching. In this paper, a characterization is given for block graphs with a unique minimum paired-dominating set. Furthermore, a constructive characterization is also given for trees with a unique minimum paired-dominating set.
| Original language | English |
|---|---|
| Pages (from-to) | 177-192 |
| Number of pages | 16 |
| Journal | Ars Combinatoria |
| Volume | 119 |
| State | Published - Jan 2015 |
Keywords
- Block graph
- Domination
- Paired-dominating set
- Tree