A lower bound for nodal count on discrete and metric graphs
From MaRDI portal
Publication:956633
DOI10.1007/s00220-007-0391-3zbMath1171.05356arXivmath-ph/0611026OpenAlexW3098936281MaRDI QIDQ956633
Publication date: 25 November 2008
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math-ph/0611026
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear difference operators (47B39) Boundary value problems on graphs and networks for ordinary differential equations (34B45)
Related Items (26)
Isospectral discrete and quantum graphs with the same flip counts and nodal counts ⋮ Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph ⋮ Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs ⋮ A theory of spectral partitions of metric graphs ⋮ Nodal statistics on quantum graphs ⋮ Quantum graphs which optimize the spectral gap ⋮ The nodal count {0,1,2,3,…} implies the graph is a tree ⋮ Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Spectral minimal partitions of unbounded metric graphs ⋮ Many nodal domains in random regular graphs ⋮ Torsional rigidity, isospectrality and quantum graphs ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs ⋮ Dynamics of nodal points and the nodal count on a family of quantum graphs ⋮ The number of nodal domains on quantum graphs as a stability index of graph partitions ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ Morse theory for discrete magnetic operators and nodal count distribution for graphs ⋮ An elementary introduction to quantum graphs ⋮ A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs ⋮ Neumann domains on quantum graphs ⋮ Graphs and their real eigenvectors ⋮ Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs ⋮ On Pleijel's nodal domain theorem for quantum graphs ⋮ On fully supported eigenfunctions of quantum graphs ⋮ On the nodal structure of nonlinear stationary waves on star graphs ⋮ Surgery principles for the spectral analysis of quantum graphs ⋮ Nonlinear Sturm oscillation: From the interval to a star
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Some geometric aspects of graphs and their eigenfunctions
- Periodic orbit theory and spectral statistics for quantum graphs
- The qualitative Sturm-Liouville theory on spatial networks
- Genericity of simple eigenvalues for a metric graph
- A discrete nodal domain theorem for trees
- Remarks on courant's nodal line theorem
- Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
- Eigenvalue and nodal properties on quantum graph trees*
- Eigenvectors of acyclic matrices
- Graph models for waves in thin structures
- Nodal counting on quantum graphs
- Resolving isospectral ‘drums’ by counting nodal domains
- Discrete nodal domain theorems
This page was built for publication: A lower bound for nodal count on discrete and metric graphs
