Return to search

Locating and Total Dominating Sets in Trees

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.

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

Page generated in 0.0019 seconds