Abstract: We give a detailed proof for two discrete analogues of Courant's Nodal Domain Theorem.
Recommendations
- Discrete quantitative nodal theorem
- scientific article; zbMATH DE number 2042150
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- Nodal domain theorems à la Courant
- On Courant's nodal domain theorem
- A discrete nodal domain theorem for trees
- On Pleijel's nodal domain theorem
- On the generalization of the Courant nodal domain theorem
- Neumann nodal domains
Cites work
- Amplitude Spectra of Fitness Landscapes
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- Eigenfunctions and nodal sets
- Eigenvectors of acyclic matrices
- Graph partitioning by eigenvectors
- scientific article; zbMATH DE number 3877889 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3726790 (Why is no real title available?)
- scientific article; zbMATH DE number 48198 (Why is no real title available?)
- scientific article; zbMATH DE number 598042 (Why is no real title available?)
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 3062950 (Why is no real title available?)
- Open problems of Paul Erd�s in graph theory
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Some geometric aspects of graphs and their eigenfunctions
Cited in
(47)- Dominant vertices in regulatory networks dynamics
- Nodal decompositions of graphs
- Nodal domain theorems à la Courant
- Landscapes on spaces of trees
- A discrete nodal domain theorem for trees
- Graph Laplacians, nodal domains, and hyperplane arrangements
- An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
- Spectral theory of Laplace operators on oriented hypergraphs
- On Pleijel's nodal domain theorem for quantum graphs
- Physics-informed graph neural Galerkin networks: a unified framework for solving PDE-governed forward and inverse problems
- \(p\)-Laplace operators for oriented hypergraphs
- A model for the emergence of the genetic code as a transition in a noisy information channel
- Ordering trees and graphs with few cycles by algebraic connectivity
- Graphs of given order and size and minimum algebraic connectivity
- On the sign patterns of the smallest signless Laplacian eigenvector
- The dual Cheeger constant and spectra of infinite graphs
- Zero forcing for sign patterns
- A theory of spectral partitions of metric graphs
- 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
- Graphs and their real eigenvectors
- Generalized modularity matrices
- The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Rugged and elementary landscapes
- Dynamics of nodal points and the nodal count on a family of quantum graphs
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- Eigenvectors of random graphs: nodal domains
- Minimum supports of eigenfunctions of graphs: a survey
- Symmetric matrices, signed graphs, and nodal domain theorems
- Many nodal domains in random regular graphs
- Nodal domain theorems for p-Laplacians on signed graphs
- Morse theory for discrete magnetic operators and nodal count distribution for graphs
- Universality of Nodal Count Distribution in Large Metric Graphs
- Editors' introduction
- Pleijel nodal domain theorem in non-smooth setting
- Extreme values of the Fiedler vector on trees
- Nodal domain theorems of signed hypergraphs
- On the distribution of local extrema in quantum chaos
- Discrete quantitative nodal theorem
- Graph homomorphisms and nodal domains
- Faber-Krahn type inequalities for trees
- On the spectrum of the normalized graph Laplacian
- A lower bound for nodal count on discrete and metric graphs
- Algebraic connectivity and degree sequences of trees
- On the isoperimetric spectrum of graphs and its approximations
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)
