Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Lin et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: