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

All graphs of order n with partition dimension 2, n−2, n−1, 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 n≥11 and diameter 2 with partition dimension n...

Full description

Bibliographic Details
Main Authors:	Edy Tri Baskoro, Debi Oktia Haryeni
Format:	Article
Language:	English
Published:	Elsevier 2020-04-01
Series:	Heliyon
Subjects:	Mathematics Partition dimension Graph Characterization Diameter
Online Access:	http://www.sciencedirect.com/science/article/pii/S2405844020305399

id	doaj-777f11a3f5b44570a4146af5c26077fc
record_format	Article
spelling	doaj-777f11a3f5b44570a4146af5c26077fc2020-11-25T03:26:44ZengElsevierHeliyon2405-84402020-04-0164e03694All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3Edy Tri Baskoro0Debi Oktia Haryeni1Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10, Bandung 40132, IndonesiaCorresponding author.; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10, Bandung 40132, IndonesiaAll graphs of order n with partition dimension 2, n−2, n−1, 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 n≥11 and diameter 2 with partition dimension n−3.http://www.sciencedirect.com/science/article/pii/S2405844020305399MathematicsPartition dimensionGraphCharacterizationDiameter
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Edy Tri Baskoro Debi Oktia Haryeni
spellingShingle	Edy Tri Baskoro Debi Oktia Haryeni All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3 Heliyon Mathematics Partition dimension Graph Characterization Diameter
author_facet	Edy Tri Baskoro Debi Oktia Haryeni
author_sort	Edy Tri Baskoro
title	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_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_sort	all graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
publisher	Elsevier
series	Heliyon
issn	2405-8440
publishDate	2020-04-01
description	All graphs of order n with partition dimension 2, n−2, n−1, 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 n≥11 and diameter 2 with partition dimension n−3.
topic	Mathematics Partition dimension Graph Characterization Diameter
url	http://www.sciencedirect.com/science/article/pii/S2405844020305399
work_keys_str_mv	AT edytribaskoro allgraphsofordern11anddiameter2withpartitiondimensionn3 AT debioktiaharyeni allgraphsofordern11anddiameter2withpartitiondimensionn3
_version_	1724590864659906560

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

Similar Items

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