Trees With Equal Domination and Paired-Domination Numbers
Document Type
Article
Publication Date
7-1-2005
Description
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 the minimum cardinality of a paired-dominating set of G, and is obviously bounded below by the domination number of G. We give a constructive characterization of the trees with equal domination and paired-domination numbers.
Citation Information
Haynes, Teresa W.; Henning, Michael A.; and Slater, Peter J.. 2005. Trees With Equal Domination and Paired-Domination Numbers. Ars Combinatoria. Vol.76 169-175. ISSN: 0381-7032