连通图中逆维纳指数Λ(G)的最大值和最小值  

Mamum and Minimum of Inverse Wiener Indices in Connected Graphs

作　　者：张冰 ZHANG Bing(Department of Electronic Information Engineering,Guangdong Polytechnic Normal University,Guangzhou Guangdong 510665)

机构地区：[1]广东技术师范大学数学与系统科学学院

出　　处：《广东技术师范学院学报》2019年第6期50-51,63,共3页Journal of Guangdong Polytechnic Normal University

摘　　要：一个连通图的维纳指数W (G)等于图中所有无序点对的距离之和,而一个连通图的逆维纳指数定义为:Λ(G)=1/2n (n-1)d-W(G),其中d表示连通图的直径,n表示顶点个数.主要研究了连通图中Λ(G)的最大值和最小值,并且得到了上界图和下界图.The Wiener indices W(G)of a connected graph is equal to the sum of the distances of all the disordered pairs of points in the graph, and the inverse Wiener indices of a connected graph is defined as: Λ(G)=1/2n(n-1)d-W(G), where d is the value of the diameter of the connected graph. In this paper, we study the maximum and minimum inverse Wiener exponents of connected graphs, and obtain upper and lower bound graphs.

关 键 词：维纳指数 逆维纳指数 连通图 最大值 最小值 

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