Ya-Lei Jin, Xiao-Dong Zhang
Published 2013-04-03Version 1
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has been well studied. Recently, Sills and Wang in 2012 proposed two conjectures on the maximal Wiener index of trees with a given degree sequence. This note proves one of the two conjectures and disproves the other.
Comments: 7 pages
Journal: MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2014
Trees with given degree sequences that have minimal subtrees
Note for Nikiforov's two conjectures on the energy of trees
Conjectures on Somos $4$, $6$ and $8$ sequences using Riordan arrays and the Catalan numbers
![QR code for arXiv:1304.0873 [math.CO]](http://oss.arxitics.com/images/favicon.svg)