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
来源：
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY | 2010年 / 63卷 / 01期
关键词：
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 条
  • [1] On the minimum Kirchhoff index of graphs with a given number of cut vertices
    Huang, Junlin
    Huang, Guixian
    Li, Jianping
    He, Weihua
    DISCRETE APPLIED MATHEMATICS, 2025, 365 : 27 - 38
  • [2] ON THE ESTRADA INDEX OF GRAPHS WITH GIVEN NUMBER OF CUT EDGES
    Du, Zhibin
    Zhou, Bo
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2011, 22 : 586 - 592
  • [3] The Minimal Kirchhoff Index of Graphs with a Given Number of Cut Vertices
    Xu, Kexiang
    Liu, Hongshuang
    Yang, Yujun
    Das, Kinkar Ch.
    FILOMAT, 2016, 30 (13) : 3451 - 3463
  • [4] Eccentric Adjacency Index of Graphs with a Given Number of Cut Edges
    Akhter, Shehnaz
    Farooq, Rashid
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (03) : 2509 - 2522
  • [5] Eccentric Adjacency Index of Graphs with a Given Number of Cut Edges
    Shehnaz Akhter
    Rashid Farooq
    Bulletin of the Malaysian Mathematical Sciences Society, 2020, 43 : 2509 - 2522
  • [6] On the minimum Kirchhoff index of graphs with a fixed number of cut vertices
    Nikseresht, Ashkan
    DISCRETE APPLIED MATHEMATICS, 2016, 207 : 99 - 105
  • [7] Cut-edges and the independence number
    Pepper, Ryan
    Henry, Greg
    Sexton, Dillon
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2006, 56 (02) : 403 - 408
  • [8] The number of subtrees in graphs with given number of cut edges
    Xu, Kexiang
    Li, Jie
    Wang, Hua
    DISCRETE APPLIED MATHEMATICS, 2021, 304 : 283 - 296
  • [9] On extremal bipartite graphs with given number of cut edges
    Chen, Hanlin
    Wu, Renfang
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (02)
  • [10] Primitive graphs with given exponents and minimum number of edges
    Kim, Byeong Moon
    Song, Byung Chul
    Hwang, Woonjae
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 420 (2-3) : 648 - 662
12345