For four graph classes, a single extremal graph simultaneously maximizes every increasing distance-based index and minimizes every decreasing one.
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
-
Distance Sequences to bound the Harary Index and other Wiener-type Indices of a Graph
For four graph classes, a single extremal graph simultaneously maximizes every increasing distance-based index and minimizes every decreasing one.