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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
University of Zielona Góra
2020-02-01
|
| Colecção: | Discussiones Mathematicae Graph Theory |
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.7151/dmgt.2112 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|