摘要
一个连通图G的Harary指数定义为图G中所有点对的距离的倒数之和.本文主要研究双圈图去掉一条割边或添加一条边后其Harary指数的上界问题,并刻画了达到上界的极值图.
The Harary index of a graph is defined as the sum of reciprocals of distances over all pairs of vertices .This paper gives an upper bound for the Harary index of bicyclic graphs and respectively charac-terizes the extreme graphs attaining the upper bound .
出处
《菏泽学院学报》
2015年第5期14-16,共3页
Journal of Heze University
基金
安庆师范学院青年科研基金项目(KJ201309)
关键词
双圈图
割边
Harary指数
bicyclic graphs
cutting edge
the Harary index
