Trees With Large Paired-Domination Number
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.
Haynes, Teresa; and Henning, Michael A.. 2006. Trees With Large Paired-Domination Number. Utilitas Mathematica. Vol.71 3-12. ISSN: 0315-3681