In graph-induced ultrametrics from vertex labelings, the distance set has size at most |E| + 1, with equality conditions identified.
SIAM9(4), 551–570 (1961)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GN 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Gomory-Hu inequality and trees
In graph-induced ultrametrics from vertex labelings, the distance set has size at most |E| + 1, with equality conditions identified.