Babai, Asymmetric trees with two prescribed degrees, Acta Math

· 1977

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

citation-role summary

background 1

unclear 1

math.CO · 2024-12-20 · conditional · novelty 7.0

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.

Showing 1 of 1 citing paper.

Breaking Symmetry in Graphs by Resolving Sets math.CO · 2024-12-20 · conditional · none · ref 5
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.