A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph

arXiv2210.08516MaRDI QIDQ6160889FDOQ6160889

Authors: Sebastian Cioaba, Vishal Gupta 

Publication date: 2 June 2023

Full work available at URL: https://arxiv.org/abs/2210.08516

Recommendations

• The smallest eigenvalue of \(K_{r}\)-free graphs
• On the limit points of the smallest eigenvalues of regular graphs
• Combinatorial upper bounds for the smallest eigenvalue of a graph
• Tight estimates for eigenvalues of regular graphs
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)

zbMATH Keywords

triangulationsmallest eigenvalueassociahedron graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random walks on graphs (05C81)

This page was built for publication: A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph

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