Interlacing inequalities for eigenvalues of discrete Laplace operators
DOI10.1007/s10455-012-9341-1zbMath1276.05129arXiv1111.1836OpenAlexW2025862600MaRDI QIDQ1941761
Publication date: 21 March 2013
Published in: Annals of Global Analysis and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.1836
simplicial complexesLaplacian spectrumcovering spaceinterlacing inequalitiesCombinatorial Laplacian operator
Covering spaces and low-dimensional topology (57M10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Relations of low-dimensional topology with graph theory (57M15) Spectral sets of linear operators (47A25) Combinatorial aspects of simplicial complexes (05E45)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Laplacian matrices of graphs: A survey
- Interlacing eigenvalues and graphs
- Covering complexes with applications to algebra
- Spectra of combinatorial Laplace operators on simplicial complexes
- A common recursion for Laplacians of matroids and shifted simplicial complexes
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Shifted simplicial complexes are Laplacian integral
- The Laplacian Spectrum of a Graph
- Note on deleting a vertex and weak interlacing of the Laplacian spectrum
- Interlacing for weighted graphs using the normalized Laplacian
- Rank one perturbation and its application to the laplacian spectrum of a graph∗
- An Interlacing Result on Normalized Laplacians
This page was built for publication: Interlacing inequalities for eigenvalues of discrete Laplace operators