Photo from wikipedia
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… Click to show full abstract
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.
Keywords:
order diameter;
partition dimension;
partition;
graphs order
Journal Title: Heliyon
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Heliyon
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!