Locating and Total Dominating Sets in Trees.

<p>A set <em>S</em> of vertices in a graph <em>G</em>=(<em>V</em>,<em>E</em>) is a total dominating set of <em>G</em> if every vertex of <em>V</em> is adjacent to some vertex in <em>S</em>. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of <em>V</em> are totally dominated by distinct subsets of the total dominating set.</p>

Name thesis:degree_name

MS (Master of Science)

Level thesis:degree_level

Thesis - unrestricted

Discipline thesis:degree_discipline

Mathematical Sciences

Year dc:date.issued

2004

Author dc:creator

• Howard, Jamie Marie

• differentiating total dominating set
• locating-total dominating set
• Physical Sciences and Mathematics

Statement dc:rights

• Copyright by the authors.

Repository record dc:identifier

https://dc.etsu.edu/etd/872

OAI identifier oai:identifier

oai:dc.etsu.edu:etd-2029