Abstract
The algebraic connectivity of a connected graph G is the second smallest eigenvalue of the Laplacian matrix of G. In this paper, some new upper bounds on algebraic connectivity are obtained by applying generalized interlacing to an appropriate quotient matrix.
Author supplied keywords
Cite
CITATION STYLE
APA
Lin, Z., & Miao, L. (2022). UPPER BOUNDS ON THE ALGEBRAIC CONNECTIVITY OF GRAPHS∗. Electronic Journal of Linear Algebra, 38, 77–84. https://doi.org/10.13001/ela.2022.5133
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free