Title

Trees With Large Paired-Domination Number

Document Type

Article

Publication Date

11-1-2006

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

This document is currently not available here.

Share

COinS