The minimal Kirchhoff index of graphs with a given number of cut vertices
The minimal Kirchhoff index of graphs with a given number of cut vertices
复制标题
DOI：
10.2298/fil1613451x
复制
发表时间：
2016-11
期刊：
影响因子：
0.8
通讯作者：
Kexiang Xu;Hongshuang Liu;Yujun Yang;K. Das
中科院分区：
文献类型：
--
作者：
Kexiang Xu;Hongshuang Liu;Yujun Yang;K. Das
电阻距离是由Klein和Randi c引入的，作为经典距离的推广。图G的Kirchhoff指数Kf（G）是图G中所有无序顶点对之间的电阻距离之和。在本文中，我们确定了具有k个割点的所有n-顶点图中具有最小Kirchhoff指数的极图，其中$1\leq k< \frac{n}{2}$。
The resistance distance was introduced by Klein and Randi´c as a generalization of the classical distance. The Kirchhoff index Kf (G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this paper we determine the extremal graphs with minimal Kirchhoff index among all n-vertex graphs with k cut vertices where $1\leq k< \frac{n}{2}$ .