摘要
一个图的Winer指标是指图的所有顶点对的距离之和.本文确定了所有只有一条最长路的n阶树中(n>19)Wiener指标从第一小至第五小的树.
The Wiener index of a connected graph was defined as the sum of distances between all unor dered pairs of its vertices. The Wiener indices from the smallest to the fifth-small trees in all n order ( n 〉19) trees which had exactly one longest path were determined.
出处
《集美大学学报(自然科学版)》
CAS
2014年第3期215-218,共4页
Journal of Jimei University:Natural Science