摘要
图G的Wiener指数定义为图中所有点对u,v的距离之和∑d_G(u,v).在给定顶点和直径的所有树中具有第三小Wiener指数的树的特征,得到这类树的Wiener指数排序的方法.
The Wiener index W（G） of a graph G is defined as the sum of d_G（u,v） over all pairs of vertices,where d_g（u,v） is the distance between vertices u and v in G.In this paper,we characterize the tree with third-minimum Wiener index and introduce the method of obtaining the order of the Wiener indices among all the trees with given order and diameter,respectively.
出处
《运筹学学报》
CSCD
2011年第4期36-44,共9页
Operations Research Transactions
基金
supported by Natural Science Foundation of Department of Education of Anhui Province (KJ201 1Z236)
