Bounds on the Locating-Domination Number and Differentiating-Total Domination Number in Trees
A subset S of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V − S has a neighbor in S, and is a total dominating set if every vertex in V has a neighbor in S. A dominating set S is a locating-dominating set of G if every two vertices x, y ∈ V − S satisfy N(x) ∩ S ≠ N(y) ∩...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2018-05-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2012 |