Return to search

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.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19436
Date01 November 2006
CreatorsHaynes, Teresa, Henning, Michael A.
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0022 seconds