分裂图的Wiener指标  

Wiener Index of Split Graph

作　　者：李亚平 唐子兴 LI Yaping;TANG Zixing(College of Mathematics and Statistics,Kashi University,844008,Kashi,Xinjiang,PRC)

机构地区：[1]喀什大学数学与统计学院,新疆844008

出　　处：《江西科学》2022年第4期636-638,共3页Jiangxi Science

基　　金：国家自然科学基金项目(12061039);喀什大学校级一般项目(20212745)。

摘　　要：连通图G的Wiener指标W(G)被定义为图G中所有点对之间的距离之和。分裂图是其顶点集可以划分为独立集和团的不相交并集的图,本文给出了直径为3的分裂图的Wiener指标的计算公式。The Wiener index W(G)of a connected graph G is defined to be the sum of distances between all pairs of vertices in G.A split graph is one whose vertex set can be partitioned as the disjoint union of an independent set and a clique.In this article,the formulae for computing the Wiener index of split graph on n vertices with diameter equal to 3 are deduced.

关 键 词：WIENER指标 分裂图 连通性 

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