Discrete nodal domain theorems
From MaRDI portal
Publication:5954844
DOI10.1016/S0024-3795(01)00313-5zbMATH Open0990.05093arXivmath/0009120OpenAlexW2034647728WikidataQ56991819 ScholiaQ56991819MaRDI QIDQ5954844FDOQ5954844
Graham M. L. Gladwell, E. Brian Davies, Peter F. Stadler, Josef Leydold
Publication date: 7 August 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: We give a detailed proof for two discrete analogues of Courant's Nodal Domain Theorem.
Full work available at URL: https://arxiv.org/abs/math/0009120
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Schrödinger operator, Schrödinger equation (35J10) Signed and weighted graphs (05C22) General topics in linear spectral theory for PDEs (35P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenfunctions and nodal sets
- Graph partitioning by eigenvectors
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Open problems of Paul Erd�s in graph theory
- Eigenvectors of acyclic matrices
- Some geometric aspects of graphs and their eigenfunctions
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- Amplitude Spectra of Fitness Landscapes
Cited In (46)
- Discrete quantitative nodal theorem
- Dynamics of nodal points and the nodal count on a family of quantum graphs
- Algebraic connectivity and degree sequences of trees
- A discrete nodal domain theorem for trees
- Universality of Nodal Count Distribution in Large Metric Graphs
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees
- Rugged and Elementary Landscapes
- Nodal domain theorems for \(p\)-Laplacians on signed graphs
- A model for the emergence of the genetic code as a transition in a noisy information channel
- Editors' introduction
- Generalized modularity matrices
- On the isoperimetric spectrum of graphs and its approximations
- Graph homomorphisms and nodal domains
- On the distribution of local extrema in quantum chaos
- A theory of spectral partitions of metric graphs
- Dominant vertices in regulatory networks dynamics
- Spectral theory of Laplace operators on oriented hypergraphs
- Graphs and their real eigenvectors
- Nodal decompositions of graphs
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
- On the spectrum of the normalized graph Laplacian
- Nodal domain theorems à la Courant
- Zero forcing for sign patterns
- Pleijel nodal domain theorem in non-smooth setting
- Extreme values of the Fiedler vector on trees
- Graph Laplacians, nodal domains, and hyperplane arrangements
- On Pleijel's nodal domain theorem for quantum graphs
- Morse theory for discrete magnetic operators and nodal count distribution for graphs
- Faber-Krahn type inequalities for trees
- A lower bound for nodal count on discrete and metric graphs
- \(p\)-Laplace operators for oriented hypergraphs
- The dual Cheeger constant and spectra of infinite graphs
- Landscapes on spaces of trees
- The nodal count {0,1,2,3,…} implies the graph is a tree
- Nodal domain count for the generalized graph \(p\)-Laplacian
- Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering
- Physics-informed graph neural Galerkin networks: a unified framework for solving PDE-governed forward and inverse problems
- Ordering trees and graphs with few cycles by algebraic connectivity
- Many nodal domains in random regular graphs
- Eigenvectors of random graphs: Nodal Domains
- Symmetric matrices, signed graphs, and nodal domain theorems
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- Minimum supports of eigenfunctions of graphs: a survey
- Graphs of given order and size and minimum algebraic connectivity
- On the sign patterns of the smallest signless Laplacian eigenvector
Recommendations
- Perron-Frobenius type results and discrete versions of nodal domain theorems 👍 👎
- Neumann nodal domains 👍 👎
- A discrete nodal domain theorem for trees 👍 👎
- Courant's Nodal Line Theorem and Its Discrete Counterparts 👍 👎
- On the generalization of the Courant nodal domain theorem 👍 👎
- On Pleijel's Nodal Domain Theorem 👍 👎
- On Courant's nodal domain theorem 👍 👎
- Discrete quantitative nodal theorem 👍 👎
- Nodal domain theorems à la Courant 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Discrete nodal domain theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954844)
