Discrete quantitative nodal theorem

DOI10.37236/9944zbMath1473.05179arXiv1601.06400OpenAlexW3202967365MaRDI QIDQ820852

László Lovász

Publication date: 28 September 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Cheeger's inequality for graphsLaplacian of a connected graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items (2)

Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs

Cites Work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Nodal geometry of graphs on surfaces
• Eigenvalues and expanders
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• A short proof of the planarity characterization of Colin de Verdière
• Approximating the Permanent
• Discrete nodal domain theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete quantitative nodal theorem