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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2020-04-01
|
| Series: | Heliyon |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844020305399 |