Spectral gap of the largest eigenvalue of the normalized graph Laplacian

DOI10.1007/s40304-020-00222-7zbMath1503.05076arXiv1910.14402OpenAlexW3151254556MaRDI QIDQ2674036

Raffaella Mulas, Florentin Münch, Juergen Jost

Publication date: 22 September 2022

Published in: Communications in Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.14402

zbMATH Keywords

largest eigenvaluesharp boundsnormalized Laplacianspectral graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Vertex degrees (05C07)

Related Items

Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology ⋮ Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator ⋮ Petals and books: The largest Laplacian spectral gap from 1

Cites Work

• Unnamed Item
• Bounds on normalized Laplacian eigenvalues of graphs
• On graphs with at least three distance eigenvalues less than \(-1\)
• On the spectrum of the normalized Laplacian for signed graphs: interlacing, contraction, and replication

This page was built for publication: Spectral gap of the largest eigenvalue of the normalized graph Laplacian