A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-4271 |
| Date | 01 May 2006 |
| Creators | Haynes, Teresa W., Henning, Michael A., Howard, Jamie |
| 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.0021 seconds