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.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19436 |
| Date | 01 November 2006 |
| Creators | Haynes, Teresa, Henning, Michael A. |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.002 seconds