Bounds for metric dimensions of generalized neighborhood corona graphs

In this paper, the authors analysed metric dimensions of arbitrary graphs [Formula: see text] in which graphs [Formula: see text] are non-trivial, [Formula: see text] is connected, and [Formula: see text] denotes generalized neighborhood corona operation. We found lower bounds of [Formula: see text]...

Descripción completa

Detalles Bibliográficos
Autores principales: Rinurwati, Setiawan, S.E., Slamin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2021
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8264611/
https://www.ncbi.nlm.nih.gov/pubmed/34278028
http://dx.doi.org/10.1016/j.heliyon.2021.e07433
Descripción
Sumario:In this paper, the authors analysed metric dimensions of arbitrary graphs [Formula: see text] in which graphs [Formula: see text] are non-trivial, [Formula: see text] is connected, and [Formula: see text] denotes generalized neighborhood corona operation. We found lower bounds of [Formula: see text] as function of [Formula: see text] where [Formula: see text] denotes adjacency metric dimensions of [Formula: see text]. We also found upper bounds of [Formula: see text] when G does not contain pair of false twin vertices. Furthermore, we found a characteristic of [Formula: see text] which indicates that our lower bounds are strict.

Ejemplares similares