Title

Characterizations of Trees With Equal Paired and Double Domination Numbers

Document Type

Article

Publication Date

8-28-2006

Description

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching, and a double dominating set is a dominating set that dominates every vertex of G at least twice. We show that for trees, the paired-domination number is less than or equal to the double domination number, solving a conjecture of Chellali and Haynes. Then we characterize the trees having equal paired and double domination numbers.

Share

COinS