Some new lower bounds on the algebraic connectivity of graphs

被引：0
|
作者：
Lin, Zhen [1 ]
Zhang, Rong [2 ]
Wang, Juan [3 ]
机构：
[1] Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
[2] Yancheng Teachers Univ, Sch Math & Stat, Yancheng 224002, Jiangsu, Peoples R China
[3] Qufu Normal Univ, Sch Management, Rizhao 276826, Shandong, Peoples R China
来源：
CONTRIBUTIONS TO MATHEMATICS | 2023年 / 7卷
基金：
中国国家自然科学基金;
关键词：
algebraic connectivity; spanning trees; first Zagreb index; LAPLACIAN SPECTRUM; EIGENVALUES; RESISTANCE;
D O I：
10.47443/cm.2023.016
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The second-smallest eigenvalue of the Laplacian matrix of a graph G is called the algebraic connectivity of G , which is one of the most-studied parameters in spectral graph theory and network science. In this paper, we obtain some new lower bounds of the algebraic connectivity by rank-one perturbation matrix and compare them with known results.
引用
收藏
页码：53 / 59
页数：7
相关论文
共 50 条
  • [41] Two lower bounds for generalized 3-connectivity of Cartesian product graphs
    Gao, Hui
    Lv, Benjian
    Wang, Kaishun
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 338 : 305 - 313
  • [42] Lower bounds on the OBDD size of graphs of some popular functions
    Sawitzki, D
    SOFSEM 2005:THEORY AND PRACTICE OF COMPUTER SCIENCE, 2005, 3381 : 298 - 309
  • [43] Some Lower Bounds for the Energy of Graphs in Terms of Spread of Matrix
    Jahanbani, Akbar
    Sheikholeslami, Seyed Mahmoud
    MEDITERRANEAN JOURNAL OF MATHEMATICS, 2023, 20 (01)
  • [44] Lower bounds for independence numbers of some locally sparse graphs
    Li, Yusheng
    Lin, Qizhong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (04) : 717 - 725
  • [45] Some Lower Bounds for the Energy of Graphs in Terms of Spread of Matrix
    Akbar Jahanbani
    Seyed Mahmoud Sheikholeslami
    Mediterranean Journal of Mathematics, 2023, 20
  • [46] Lower bounds for independence numbers of some locally sparse graphs
    Yusheng Li
    Qizhong Lin
    Journal of Combinatorial Optimization, 2014, 28 : 717 - 725
  • [47] New spectral lower bounds on the bisection width of graphs
    Bezrukov, S
    Elsässer, R
    Monien, B
    Preis, R
    Tillich, JP
    THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 155 - 174
  • [48] New Lower Bounds for Oblivious Routing in Undirected Graphs
    Hajiaghayi, Mohammad T.
    Kleinberg, Robert D.
    Leighton, Tom
    Raecke, Harald
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 918 - +
  • [49] New lower bounds for Ramsey numbers of graphs and hypergraphs
    Lazebnik, F
    Mubayi, D
    ADVANCES IN APPLIED MATHEMATICS, 2002, 28 (3-4) : 544 - 559
  • [50] Tight Bounds for Algebraic Gossip on Graphs
    Borokhovich, Michael
    Avin, Chen
    Lotker, Zvi
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1758 - 1762
12345