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-clomination number of G is bounded above by twice the domination number of G. We give a constructive characterization of the trees attaining this bound.