Xiao-Dong Zhang, Yong Liu, Min-Xian Han
Published 2009-07-22Version 1
The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.
Comments: 19 pages, 2 figures
Maximum and minimum nullity of a tree degree sequence
On the Wiener Index of Orientations of Graphs
Trees maximizing the number of almost-perfect matchings
![QR code for arXiv:0907.3772 [math.CO]](http://oss.arxitics.com/images/favicon.svg)