Bounds on the Locating-Total Domination Number in Trees
Given a graph G = (V, E) with no isolated vertex, a subset S of V is called a total dominating set of G if every vertex in V has a neighbor in S. A total dominating set S is called a locating-total dominating set if for each pair of distinct vertices u and v in V \ S, N(u) ∩ S ≠ N(v) ∩ S. The minimu...
| Autores principales: | , , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
University of Zielona Góra
2020-02-01
|
| Colección: | Discussiones Mathematicae Graph Theory |
| Materias: | |
| Acceso en línea: | https://doi.org/10.7151/dmgt.2112 |