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.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19890 |
| Date | 01 October 2004 |
| Creators | Chellali, Mustapha, Haynes, Teresa W. |
| 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.0023 seconds