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 subse...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2004
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/872 https://dc.etsu.edu/cgi/viewcontent.cgi?article=2029&context=etd |