On the Two Conjectures of the Wiener Index
Combinatorics
2013-04-04 v1
Abstract
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.
Cite
@article{arxiv.1304.0873,
title = {On the Two Conjectures of the Wiener Index},
author = {Ya-Lei Jin and Xiao-Dong Zhang},
journal= {arXiv preprint arXiv:1304.0873},
year = {2013}
}
Comments
7 pages