连通图的Harry指数定义为所有顶点对的距离倒数和.本文对具有k个悬挂点的n阶单圈图的Harary指数进行了研究,并给出了此类图中具有极大Harary指数的图类。
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph.In this paper,the graph with the largest Harary index among all the unicyclic graphs with n vertices and k pendent vertices were investigated.