Isospectral discrete and quantum graphs with the same flip counts and nodal counts

DOI10.1088/1751-8121/AAC039MaRDI QIDQ3176511zbMATH OpenOpenAlexWikidataFDO

Authors Jonas S. Juul, C. H. Joyner

Publication date 20 July 2018

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

graph theoryspectral theorynodal domains

Mathematics Subject Classification ID

General topics in linear spectral theory for PDEs (35P05) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Isospectrality (58J53) Quantum chaos (81Q50)

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.

Recommendations

• Isospectral graphs with identical nodal counts
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
• Quasi-isospectrality on quantum graphs
• On Isospectral Graphs.
• Quantum graphs which sound the same

Cites work

• scientific article; zbMATH DE number 48198 (Why is no real title available?)
• 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?
• Complex patterns in wave functions: drums, graphs and disorder
• Constructing cospectral graphs
• Counting nodal domains on surfaces of revolution
• Critical partitions and nodal deficiency of billiard eigenfunctions
• Discrete nodal domain theorems
• Drums That Sound the Same
• Eigenvectors of Random Graphs: Nodal Domains
• Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
• Equivalence between isospectrality and isolength spectrality for a certain class of planar billiard domains
• Introduction to quantum graphs
• 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 domains on graphs - How to count them and why?
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
• On the nodal count for flat tori
• One cannot hear the shape of a drum
• Resolving isospectral ‘drums’ by counting nodal domains
• Riemannian coverings and isospectral manifolds
• Some planar isospectral domains
• Spectral problems with mixed Dirichlet-Neumann boundary conditions: isospectrality and beyond
• Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
• The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
• The number of nodal domains on quantum graphs as a stability index of graph partitions

Cited in

(5)

• Nodal counting on quantum graphs
• A geometric construction of isospectral magnetic graphs
• Isospectral graphs with identical nodal counts
• Neumann domains on quantum graphs
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?

This page was built for publication: Isospectral discrete and quantum graphs with the same flip counts and nodal counts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176511)