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
Descripción
Sumario: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].

Ejemplares similares