Petals and books: The largest Laplacian spectral gap from 1
From MaRDI portal
Publication:6084713
DOI10.1002/jgt.22999zbMath1526.05093arXiv2110.08751OpenAlexW4383264401MaRDI QIDQ6084713
Juergen Jost, Raffaella Mulas, Dong Zhang
Publication date: 6 November 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.08751
neighborhood graphspectral gapsnormalized Laplacianspectral graph theoryeigenvalue 1maximal gap interval
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectrum of the normalized graph Laplacian
- On the second eigenvalue of a graph
- A sharp bound for the ratio of the first two eigenvalues of Dirichlet Laplacians and extensions
- Cubic Ramanujan graphs
- Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplace operator
- Spectral gap of the largest eigenvalue of the normalized graph Laplacian
- Twin Vertices in Hypergraphs
- Riemannian geometry and geometric analysis
- Gap sets for the spectra of cubic graphs
This page was built for publication: Petals and books: The largest Laplacian spectral gap from 1