All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3

All graphs of order n with partition dimension 2, [Formula: see text] , [Formula: see text] , or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open. In this paper, we characterize all graphs of order [Formula: se...

Descripción completa

Detalles Bibliográficos
Autores principales: Baskoro, Edy Tri, Haryeni, Debi Oktia
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7160584/
https://www.ncbi.nlm.nih.gov/pubmed/32322708
http://dx.doi.org/10.1016/j.heliyon.2020.e03694
_version_ 1783522786384281600
author Baskoro, Edy Tri
Haryeni, Debi Oktia
author_facet Baskoro, Edy Tri
Haryeni, Debi Oktia
author_sort Baskoro, Edy Tri
collection PubMed
description All graphs of order n with partition dimension 2, [Formula: see text] , [Formula: see text] , or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open. In this paper, we characterize all graphs of order [Formula: see text] and diameter 2 with partition dimension [Formula: see text].
format Online
Article
Text
id pubmed-7160584
institution National Center for Biotechnology Information
language English
publishDate 2020
publisher Elsevier
record_format MEDLINE/PubMed
spelling pubmed-71605842020-04-22 All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3 Baskoro, Edy Tri Haryeni, Debi Oktia Heliyon Article All graphs of order n with partition dimension 2, [Formula: see text] , [Formula: see text] , or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open. In this paper, we characterize all graphs of order [Formula: see text] and diameter 2 with partition dimension [Formula: see text]. Elsevier 2020-04-14 /pmc/articles/PMC7160584/ /pubmed/32322708 http://dx.doi.org/10.1016/j.heliyon.2020.e03694 Text en © 2020 The Authors http://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 Article
Baskoro, Edy Tri
Haryeni, Debi Oktia
All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
title All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
title_full All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
title_fullStr All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
title_full_unstemmed All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
title_short All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
title_sort all graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7160584/
https://www.ncbi.nlm.nih.gov/pubmed/32322708
http://dx.doi.org/10.1016/j.heliyon.2020.e03694
work_keys_str_mv AT baskoroedytri allgraphsofordern11anddiameter2withpartitiondimensionn3
AT haryenidebioktia allgraphsofordern11anddiameter2withpartitiondimensionn3

Ejemplares similares