Cargando…
Computing locating-total domination number in some rotationally symmetric graphs
Let [Formula: see text] be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G, for every pair of vertices [Formula: see text] , such that [Formula: see text] . The minimum cardinality of a locating-total dominating set is called locating-total dominati...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
SAGE Publications
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10358605/ https://www.ncbi.nlm.nih.gov/pubmed/34787037 http://dx.doi.org/10.1177/00368504211053417 |