只有一条最长路的树的Wiener指标  

Wiener Index of Trees with Exactly One Longest Path

作　　者：宋梦华[1] 

机构地区：[1]集美大学理学院,福建厦门361021

出　　处：《集美大学学报（自然科学版）》2014年第3期215-218,共4页Journal of Jimei University：Natural Science

摘　　要：一个图的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.

关 键 词：WIENER指标 直径 毛毛虫树 最长路 

分 类 号：O157.1[理学—数学]