On the minimum Kirchhoff index of graphs with a given number of cut-edges

被引:0
|
作者
Deng, Hanyuan [1 ]
机构
[1] Hunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
关键词
RESISTANCE-DISTANCE; UNICYCLIC GRAPHS; CYCLICITY;
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The Kirchhoff index Kf (G) of a graph G is the sum of resistance distances between all pairs of vertices. In this paper, we give the minimum Kirchhoff index among all connected graphs with n vertices and k cut edges, and characterize the extremal graph.
引用
收藏
页码:171 / 180
页数:10
相关论文
共 50 条