TY - JOUR

T1 - The extremal values of the Wiener index of a tree with given degree sequence

AU - Wang, Hua

PY - 2008/7/28

Y1 - 2008/7/28

N2 - 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. Székely, 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.

AB - 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. Székely, 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.

KW - Degree sequence

KW - Tree

KW - Wiener index

UR - http://www.scopus.com/inward/record.url?scp=50649121404&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2007.11.005

DO - 10.1016/j.dam.2007.11.005

M3 - Article

SN - 0166-218X

VL - 156

SP - 2647

EP - 2654

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 14

ER -