Extremal Wiener Index of Trees with Given Number of Vertices of Even Degree
Extremal Wiener Index of Trees with Given Number of Vertices of Even Degree
复制标题
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Hongying Lin
中科院分区：
文献类型：
--
作者：
Hongying Lin
连通图的维纳指数定义为其所有顶点对之间的距离之和。在本文中，我们分别描述了具有给定偶数度顶点数的所有树中使维纳指数最小化和最大化的树。
The Wiener index of a connected graph is defined as the sum of distances between all pairs of its vertices. In this paper, we characterize the trees which minimize and maximize the Wiener index among all trees with given number of vertices of even degree respectively.