An upper bound for higher order eigenvalues of symmetric graphs
From MaRDI portal
Publication:2058823
Abstract: In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.
Recommendations
- Eigenvalue sum estimates for lattice subgraphs
- Bounds on normalized Laplacian eigenvalues of graphs
- Eigenvalue estimates of the \(p\)-Laplacian on finite graphs
- Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
- Bounds on the negative eigenvalues of Laplacians on finite metric graphs
Cites work
- scientific article; zbMATH DE number 3710664 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3110482 (Why is no real title available?)
- Estimates on eigenvalues of Laplacian
- On the Ratio of Consecutive Eigenvalues
- On the Ratio of Consecutive Eigenvalues in N‐Dimensions
Cited in
(2)
This page was built for publication: An upper bound for higher order eigenvalues of symmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2058823)