Some New Lower Bounds on the Algebraic Connectivity of Graphs

IF 0.4 4区数学 Q4 MATHEMATICS

Contributions To Discrete Mathematics Pub Date : 2023-06-02 DOI:10.47443/cm.2023.016

Zhen Lin, Rong Zhang, Juan Wang

引用次数: 0

Abstract

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.

查看原文本刊更多论文

图的代数连通性的几个新下界

图G的拉普拉斯矩阵的第二小特征值称为G的代数连通性，是谱图理论和网络科学中研究最多的参数之一。本文利用秩一扰动矩阵给出了代数连通性的一些新的下界，并与已知结果进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Contributions To Discrete Mathematics MATHEMATICS-

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Contributions to Discrete Mathematics (ISSN 1715-0868) is a refereed e-journal dedicated to publishing significant results in a number of areas of pure and applied mathematics. Based at the University of Calgary, Canada, CDM is free for both readers and authors, edited and published online and will be mirrored at the European Mathematical Information Service and the National Library of Canada.