The nodal count \0,1,2,3,\ implies the graph is a tree
From MaRDI portal
Publication:2945348
DOI10.1098/RSTA.2012.0504zbMATH Open1352.34019arXiv1212.6710OpenAlexW3123681079WikidataQ37399873 ScholiaQ37399873MaRDI QIDQ2945348FDOQ2945348
Authors: R. Band 
Publication date: 9 September 2015
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Abstract: Sturm's oscillation theorem states that the n-th eigenfunction of a Sturm-Liouville operator on the interval has n-1 zeros (nodes). This result was generalized for all metric tree graphs and an analogous theorem was proven for discrete tree graphs. We prove the converse theorems for both discrete and metric graphs. Namely, if for all n, the n-th eigenfunction of the graph has n-1 zeros then the graph is a tree. Our proofs use a recently obtained connection between the graph's nodal count and the magnetic stability of its eigenvalues. In the course of the proof we show that it is not possible for all (or even almost all, in the metric case) the eigenvalues to exhibit a diamagnetic behaviour. In addition, we develop a notion of 'discretized' versions of a metric graph and prove that their nodal counts are related to this of the metric graph.
Full work available at URL: https://arxiv.org/abs/1212.6710
Recommendations
- Nodal statistics on quantum graphs
- A lower bound for nodal count on discrete and metric graphs
- Eigenvalue and nodal properties on quantum graph trees
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- Nodal count of graph eigenfunctions via magnetic perturbation
Inverse problems involving ordinary differential equations (34A55) Boundary value problems on graphs and networks for ordinary differential equations (34B45)
Cites Work
- Periodic orbit theory and spectral statistics for quantum graphs
- The spectrum of the continuous Laplacian on a graph
- Which graphs are determined by their spectrum?
- A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
- The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions
- Can one hear the shape of a graph?
- Magnetic interpretation of the nodal defect on 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
- Quantum graphs: I. Some basic structures
- Spectra of Schrödinger operators on equilateral quantum graphs
- Nodal domains and spectral minimal partitions
- Critical partitions and nodal deficiency of billiard eigenfunctions
- Kirchhoff's rule for quantum wires
- Hermitian symplectic geometry and extension theory
- Discrete nodal domain theorems
- Can One Hear the Shape of a Drum?
- Graph Laplacians and topology
- Isospectral graphs with identical nodal counts
- Remarks on courant's nodal line theorem
- Inverse nodal problems
- Eigenvectors of acyclic matrices
- On the nodal count for flat tori
- Resolving isospectral ‘drums’ by counting nodal domains
- Genericity of simple eigenvalues for a metric graph
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- On the level spacing distribution in quantum graphs.
- A lower bound for nodal count on discrete and metric graphs
- Trace formulae for quantum graphs with edge potentials
- Nodal count of graph eigenfunctions via magnetic perturbation
- Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
- Can one count the shape of a drum?
- Eigenvalue and nodal properties on quantum graph trees
- Nodal counting on quantum graphs
- Nodal domains of a non-separable problem -- the right-angled isosceles triangle
- Nodal domain counts and the chromatic number of graphs
Cited In (19)
- Complex patterns in wave functions: drums, graphs and disorder
- Universality of Nodal Count Distribution in Large Metric Graphs
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Minimizing optimal transport for functions with fixed-size nodal sets
- On the hot spots of quantum graphs
- A theory of spectral partitions of metric graphs
- On the nodal structure of nonlinear stationary waves on star graphs
- Graphs and their real eigenvectors
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Nonlinear Sturm oscillation: From the interval to a star
- Eigenvalue and nodal properties on quantum graph trees
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Extreme values of the Fiedler vector on trees
- On Pleijel's nodal domain theorem for quantum graphs
- Nodal statistics on quantum graphs
- Neumann domains on quantum graphs
- On fully supported eigenfunctions of quantum graphs
This page was built for publication: The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945348)
