Wiener index versus maximum degree in trees
Discrete Applied Mathematics
Correlation of Graph-Theoretical Indices
SIAM Journal on Discrete Mathematics
Erratum: Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence
Discrete Applied Mathematics
On the kth smallest and kth greatest modified Wiener indices of trees
Discrete Applied Mathematics
On the maximal Wiener index and related questions
Discrete Applied Mathematics
On the variable Wiener indices of trees with given maximum degree
Mathematical and Computer Modelling: An International Journal
The Wiener maximum quadratic assignment problem
Discrete Optimization
Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence
Discrete Applied Mathematics
| Hi-index | 0.06 |
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate a chemical compound's molecular graph with experimentally gathered data regarding the compound's characteristics. In [M. Fischermann, A. Hoffmann, D. Rautenbach, L.A. Szekely, L. Volkmann, Wiener index versus maximum degree in trees, Discrete Appl. Math. 122 (1-3) (2002) 127-137], the tree that minimizes the Wiener index among trees of given maximal degree is studied. We characterize trees that achieve the maximum and minimum Wiener index, given the number of vertices and the degree sequence.