Estimating the algebraic connectivity of triangle-free graphs

DOI10.12988/IMF.2013.35111zbMATH Open1283.05160OpenAlexW2512690012MaRDI QIDQ5402075FDOQ5402075

Authors: Amal Al-Saket 

Publication date: 12 March 2014

Published in: International Mathematical Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.12988/imf.2013.35111

Recommendations

• On estimating a lower bound for the Laplacian spectral radius of triangle-free graphs
• Algebraic connectivity and disjoint vertex subsets of graphs
• scientific article; zbMATH DE number 7473309
• The algebraic connectivity of a graph and its complement
• The least algebraic connectivity of graphs

zbMATH Keywords

Laplacian matrixcharacteristic polynomialalgebraic connectivityregular graphsprincipal submatrixinterlacing

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Cited In (3)

• Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
• Some new lower bounds on the algebraic connectivity of graphs
• On estimating a lower bound for the Laplacian spectral radius of triangle-free graphs

This page was built for publication: Estimating the algebraic connectivity of triangle-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402075)