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 some vertex in S. In this thesis, 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:etd-2029
Date01 May 2004
CreatorsHoward, Jamie Marie
PublisherDigital Commons @ East Tennessee State University
Source SetsEast Tennessee State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceElectronic Theses and Dissertations
RightsCopyright by the authors.

Page generated in 0.0019 seconds