Minimum higher eigenvalues of Laplacians on graphs

DOI10.1215/S0012-7094-96-08301-5zbMath0858.05071OpenAlexW1997700207MaRDI QIDQ1918368

Joel Friedman

Publication date: 23 March 1997

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/s0012-7094-96-08301-5

zbMATH Keywords

eigenvaluesadjacency matrixLaplacianconnected graphsdiagonal matrix

Mathematics Subject Classification ID

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

Related Items (4)

On the spectral density function of the Laplacian of a graph ⋮ Lower bounds of the Laplacian graph eigenvalues ⋮ On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph ⋮ Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs

Cites Work

• Non-negative matrices and Markov chains. 2nd ed
• Some geometric aspects of graphs and their eigenfunctions
• State splitting for variable-length graphs (Corresp.)
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks

This page was built for publication: Minimum higher eigenvalues of Laplacians on graphs