Wiener index versus maximum degree in trees
Wiener index versus maximum degree in trees
复制标题
DOI：
10.1016/s0166-218x(01)00357-2
复制
发表时间：
2002-10-15
影响因子：
1.1
通讯作者：
Volkmann, L
中科院分区：
文献类型：
--
作者：
Fischermann, M;Hoffmann, A;Volkmann, L
图的Wiener指标是图中所有顶点的两两距离之和。在本文中，我们刻画了在所有给定阶树和最大度树中最小化Wiener指数的树和在所有只有两个不同度点的给定阶树中最大化Wiener指数的树。(C)2002 Elsevier Science B.V.保留所有权利。
The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. In this paper, we characterize the trees which minimize the Wiener index among all trees of given order and maximum degree and the trees which maximize the Wiener index among all trees of given order that have only vertices of two different degrees. (C) 2002 Elsevier Science B.V. All rights reserved.