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
_version_ 1783719595812585472
author Rinurwati
Setiawan, S.E.
Slamin
author_facet Rinurwati
Setiawan, S.E.
Slamin
author_sort Rinurwati
collection PubMed
description 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.
format Online
Article
Text
id pubmed-8264611
institution National Center for Biotechnology Information
language English
publishDate 2021
publisher Elsevier
record_format MEDLINE/PubMed
spelling pubmed-82646112021-07-16 Bounds for metric dimensions of generalized neighborhood corona graphs Rinurwati Setiawan, S.E. Slamin Heliyon Research Article 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. Elsevier 2021-06-28 /pmc/articles/PMC8264611/ /pubmed/34278028 http://dx.doi.org/10.1016/j.heliyon.2021.e07433 Text en © 2021 The Authors https://creativecommons.org/licenses/by-nc-nd/4.0/This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
spellingShingle Research Article
Rinurwati
Setiawan, S.E.
Slamin
Bounds for metric dimensions of generalized neighborhood corona graphs
title Bounds for metric dimensions of generalized neighborhood corona graphs
title_full Bounds for metric dimensions of generalized neighborhood corona graphs
title_fullStr Bounds for metric dimensions of generalized neighborhood corona graphs
title_full_unstemmed Bounds for metric dimensions of generalized neighborhood corona graphs
title_short Bounds for metric dimensions of generalized neighborhood corona graphs
title_sort bounds for metric dimensions of generalized neighborhood corona graphs
topic Research Article
url 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
work_keys_str_mv AT rinurwati boundsformetricdimensionsofgeneralizedneighborhoodcoronagraphs
AT setiawanse boundsformetricdimensionsofgeneralizedneighborhoodcoronagraphs
AT slamin boundsformetricdimensionsofgeneralizedneighborhoodcoronagraphs

Ejemplares similares