On locating and differentiating-total domination in trees
Mustapha Chellali (2008)
Discussiones Mathematicae Graph Theory
Similarity:
A total dominating set of a graph G = (V,E) with no isolated vertex is a set S ⊆ V such that every vertex is adjacent to a vertex in S. A total dominating set S of a graph G is a locating-total dominating set if for every pair of distinct vertices u and v in V-S, N(u)∩S ≠ N(v)∩S, and S is a differentiating-total dominating set if for every pair of distinct vertices u and v in V, N[u]∩S ≠ N[v] ∩S. Let and be the minimum cardinality of a locating-total dominating set and a differentiating-total...