For every connected graph G, D(G) ≤ dim(G)+1, with equality characterized for trees and unicyclic graphs, and all graphs with D(G)=n(G)-2 classified.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Breaking Symmetry in Graphs by Resolving Sets
For every connected graph G, D(G) ≤ dim(G)+1, with equality characterized for trees and unicyclic graphs, and all graphs with D(G)=n(G)-2 classified.