Isospectral discrete and quantum graphs with the same flip counts and nodal counts
arXiv:1801.05246 · doi:10.1088/1751-8121/aac039
Abstract
The existence of non-isomorphic graphs which share the same Laplace spectrum (to be referred to as isospectral graphs) leads naturally to the following question: What additional information is required in order to resolve isospectral graphs? It was suggested by Band, Shapira and Smilansky that this might be achieved by either counting the number of nodal domains or the number of times the eigenfunctions change sign (the so-called flip count). Recently examples of (discrete) isospectral graphs with the same flip count and nodal count have been constructed by K. Ammann by utilising Godsil-McKay switching. Here we provide a simple alternative mechanism that produces systematic examples of both discrete and quantum isospectral graphs with the same flip and nodal counts.
arXiv comment16 pages, 4 figures
References in corpus (20)
- 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
- Percolation model for nodal domains of chaotic wave functions
- Eigenvectors of the discrete Laplacian on regular graphs - a statistical approach
- 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
- The Nodal Count {0, 1, 2, 3,...} Implies The Graph is a Tree
- Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
- Isospectral graphs with identical nodal counts
- Counting nodal domains on surfaces of revolution
- Nodal domains on graphs - How to count them and why?