All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
Sign Up to like & getrecommendations! Published in 2020 at "Heliyon"
DOI: 10.1016/j.heliyon.2020.e03694
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… read more here.
Keywords: order diameter; partition dimension; partition; graphs order ... See more keywords