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 do...
| Main Authors: | , , |
|---|---|
| Published: |
Digital Commons @ East Tennessee State University
2006
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etsu-works/3173 https://doi.org/10.1016/j.dam.2006.01.002 |
| Summary: | 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. |
|---|