The Nodal Count {0, 1, 2, 3,...} Implies The Graph is a Tree
arXiv:1212.6710 · doi:10.1098/rsta.2012.0504
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.
References in corpus (26)
- Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
- Kirchhoff's Rule for Quantum Wires
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Can One Hear the Shape of a Graph?
- Nodal domains statistics - a criterion for quantum chaos
- On the level spacing distribution in quantum graphs
- Spectra of Schroedinger operators on equilateral quantum graphs
- Nodal domains on quantum graphs
- On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions
- A lower bound for nodal count on discrete and metric graphs
- Nodal count of graph eigenfunctions via magnetic perturbation
- Resolving isospectral "drums" by counting nodal domains
- Can one count the shape of a drum?
- Magnetic interpretation of the nodal defect on graphs
- Nodal domains on isospectral quantum graphs: the resolution of isospectrality ?
- Critical partitions and nodal deficiency of billiard eigenfunctions
- Dynamics of nodal points and the nodal count on a family of quantum graphs
- The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions
- Isospectral graphs with identical nodal counts
- Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
- Nodal domains of a non-separable problem - the right angled isosceles triangle
- Counting nodal domains on surfaces of revolution
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- Remarks on "Resolving isospectral `drums' by counting nodal domains"
- Trace Formulae for quantum graphs with edge potentials
- Inverse Nodal Problems
Cited by in corpus (8)
- Nodal portraits of quantum billiards: Domains, lines, and statistics
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- On Pleijel's nodal domain theorem for quantum graphs
- Universality of nodal count distribution in large metric graphs
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Neumann Domains on Quantum Graphs
- On fully supported eigenfunctions of quantum graphs