On the Wiener Index of Trees with Given Number of Branching Vertices
On the Wiener Index of Trees with Given Number of Branching Vertices
复制标题
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Hongying Lin
中科院分区：
文献类型：
--
作者：
Hongying Lin
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. A vertex of a tree T with degree 3 or greater is called a branching vertex of T . In this paper, the lower bound and the upper bound of the Wiener index of an n−vertex tree with given number of branching vertices are obtained respectively.
