Return to search

Trees With Unique Minimum Paired-Dominating Sets

A paired-dominating set of a graph G is a dominating set of vertices whose induced subgraph has a perfect matching. We characterize the trees having unique minimum paired-dominating sets.

Identiferoai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19890
Date01 October 2004
CreatorsChellali, Mustapha, Haynes, Teresa W.
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
SourceETSU Faculty Works

Page generated in 0.0018 seconds