The nodal count \0,1,2,3,\ implies the graph is a tree

DOI10.1098/RSTA.2012.0504MaRDI QIDQ2945348zbMATHOpenAlexWikidataFDO

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)

Full work available at URL https://arxiv.org/abs/1212.6710

zbMATH Keywords

Sturm-Liouville problemsinverse spectral problemsquantum graphsnodal data

Mathematics Subject Classification ID

Inverse problems involving ordinary differential equations (34A55) Boundary value problems on graphs and networks for ordinary differential equations (34B45)

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.

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

Cites work

• A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
• A lower bound for nodal count on discrete and metric graphs
• Can One Hear the Shape of a Drum?
• Can one count the shape of a drum?
• Can one hear the shape of a graph?
• Critical partitions and nodal deficiency of billiard eigenfunctions
• Discrete nodal domain theorems
• Dynamics of nodal points and the nodal count on a family of quantum graphs
• Eigenvalue and nodal properties on quantum graph trees
• Eigenvectors of acyclic matrices
• Genericity of simple eigenvalues for a metric graph
• Graph Laplacians and topology
• Hermitian symplectic geometry and extension theory
• Inverse nodal problems
• Isospectral graphs with identical nodal counts
• Kirchhoff's rule for quantum wires
• Magnetic interpretation of the nodal defect on graphs
• Nodal count of graph eigenfunctions via magnetic perturbation
• Nodal counting on quantum graphs
• Nodal domain counts and the chromatic number of graphs
• Nodal domains and spectral minimal partitions
• Nodal domains of a non-separable problem -- the right-angled isosceles triangle
• On the level spacing distribution in quantum graphs.
• On the nodal count for flat tori
• Periodic orbit theory and spectral statistics for quantum graphs
• Quantum graphs: I. Some basic structures
• Remarks on courant's nodal line theorem
• Resolving isospectral ‘drums’ by counting nodal domains
• Spectra of Schrödinger operators on equilateral quantum graphs
• Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
• Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
• The number of nodal domains on quantum graphs as a stability index of graph partitions
• The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions
• The spectrum of the continuous Laplacian on a graph
• Trace formulae for quantum graphs with edge potentials
• Which graphs are determined by their spectrum?

Cited in

(20)

• Complex patterns in wave functions: drums, graphs and disorder
• Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
• On fully supported eigenfunctions of quantum graphs
• Eigenvalue and nodal properties on quantum graph trees
• Nodal count of graph eigenfunctions via magnetic perturbation
• On the nodal structure of nonlinear stationary waves on star graphs
• Minimizing optimal transport for functions with fixed-size nodal sets
• On Pleijel's nodal domain theorem for quantum graphs
• Isospectral discrete and quantum graphs with the same flip counts and nodal counts
• Graphs and their real eigenvectors
• Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
• Nonlinear Sturm oscillation: From the interval to a star
• Nodal statistics on quantum graphs
• On the hot spots of quantum graphs
• Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
• Universality of Nodal Count Distribution in Large Metric Graphs
• Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
• A theory of spectral partitions of metric graphs
• Neumann domains on quantum graphs
• Extreme values of the Fiedler vector on trees

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)