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...

Descripción completa

Detalles Bibliográficos
Autores principales: Raza, Hassan, Iqbal, Naveed, Khan, Hamda, Botmart, Thongchai
Formato: Online Artículo Texto
Lenguaje:English
Publicado: SAGE Publications 2021
Materias:
Original Manuscript
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
Descripción
Sumario: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 domination number and represented as [Formula: see text] . In this paper, locating-total domination number is determined for some cycle-related graphs. Furthermore, some well-known graphs of convex polytopes from the literature are also considered for the locating-total domination number.

Ejemplares similares