给定悬挂点数图的Harary指数的极图  

Extremal Graph for the Harary Index of Graphs on the Given Number of Suspension Point

作　　者：龚奇娟[1] 余桂东[1] 

机构地区：[1]安庆师范学院数学与计算科学学院,安徽安庆246133

出　　处：《安庆师范学院学报（自然科学版）》2013年第3期13-17,共5页Journal of Anqing Teachers College(Natural Science Edition)

基　　金：安徽高校省级科学研究重点项目(KJ2011A195)资助

摘　　要：图的Harary指数定义为图中所有顶点对的距离的倒数之和。本文我们刻画了给定顶点数和悬挂点数的图类中,Harary指数取到最大、第二大、第三大的极图,并由此确定了关于悬挂点数的Harary指数上界。The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper, we characterize the extremal graph with the maximum, the second and the third largest Harary index among all graphs with given order and suspension point, and give an upper bound for the Harary index with the number of suspension pmnt.

关 键 词：图 Harary指数 悬挂点 

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