For four graph classes, a single extremal graph simultaneously maximizes every increasing distance-based index and minimizes every decreasing one.
Upper and Lower Bounds for Generalized Wiener Indices on unicyclic graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
The aim of this paper is to obtain new inequalities for a large family of generalizations of the Wiener Index and to characterize the set of extremal graphs with respect to them. Our main results provide upper and lower bounds for these topological indices on unicyclic graphs.
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.