Upper bounds on the algebraic connectivity of graphs | Zendy

Zhen Lin | Zendy; Lianying Miao | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Upper bounds on the algebraic connectivity of graphs

Author(s) -

Zhen Lin,

Lianying Miao

Publication year - 2022

Publication title -

electronic journal of linear algebra

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.447

H-Index - 31

eISSN - 1537-9582

pISSN - 1081-3810

DOI - 10.13001/ela.2022.5133

Subject(s) - algebraic connectivity , mathematics , laplacian matrix , quotient , algebraic number , interlacing , eigenvalues and eigenvectors , combinatorics , upper and lower bounds , discrete mathematics , graph , connectivity , algebraic graph theory , computer science , operating system , mathematical analysis , physics , quantum mechanics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research