论文信息 - All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3

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−3.

Edy Tri Baskoro | Debi Oktia Haryeni

[1] Gary Chartrand,et al. Resolvability in graphs and the metric dimension of a graph , 2000, Discret. Appl. Math..

[2] Gary Chartrand,et al. The partition dimension of a graph , 2000 .

[3] Ioan Tomescu. Discrepancies between metric dimension and partition dimension of a connected graph , 2008, Discret. Math..

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

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