Lower bounds of the Laplacian graph eigenvalues

DOI10.1016/S0019-3577(04)80021-1zbMATH Open1066.05090MaRDI QIDQ2486121FDOQ2486121

Aleksandar Torgašev, Miroslav Petrović

Publication date: 5 August 2005

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Recommendations

• On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Minimum higher eigenvalues of Laplacians on graphs
• Bounds for Laplacian graph eigenvalues
• On a lower bound for the Laplacian eigenvalues of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Laplacian matrices of graphs: A survey
• Laplacian graph eigenvectors
• Title not available (Why is that?)
• An interrelation between line graphs, eigenvalues, and matroids
• The path is the tree with smallest greatest Laplacian eigenvalue
• Minimum higher eigenvalues of Laplacians on graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
• The Łojasiewicz inequality for free energy functionals on a graph
• Convergence to global equilibrium for Fokker-Planck equations on a graph and Talagrand-type inequalities
• Graph Embeddings and Laplacian Eigenvalues
• Laplacian eigenvalues and fixed size multisection
• Lower bounds for the eigenvalues of Laplacian matrices
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Lower bounds of the Laplacian graph eigenvalues

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