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

DOI10.1088/1751-8121/AAC039zbMATH Open1394.81131arXiv1801.05246OpenAlexW2783424995WikidataQ119442895 ScholiaQ119442895MaRDI QIDQ3176511FDOQ3176511

C. H. Joyner, Jonas S. Juul

Publication date: 20 July 2018

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Can one hear the shape of a graph?
• Magnetic interpretation of the nodal defect on graphs
• The number of nodal domains on quantum graphs as a stability index of graph partitions
• Title not available (Why is that?)
• Constructing cospectral graphs
• Critical partitions and nodal deficiency of billiard eigenfunctions
• Kirchhoff's rule for quantum wires
• Discrete nodal domain theorems
• Can One Hear the Shape of a Drum?
• Riemannian coverings and isospectral manifolds
• Some planar isospectral domains
• Isospectral graphs with identical nodal counts
• Complex patterns in wave functions: drums, graphs and disorder
• On the nodal count for flat tori
• Resolving isospectral ‘drums’ by counting nodal domains
• The nodal count {0,1,2,3,…} implies the graph is a tree
• Nodal domains on graphs - How to count them and why?
• A lower bound for nodal count on discrete and metric graphs
• One cannot hear the shape of a drum
• Nodal count of graph eigenfunctions via magnetic perturbation
• Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
• Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
• Can One Count the Shape of a Drum?
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
• Counting nodal domains on surfaces of revolution
• Nodal counting on quantum graphs
• Spectral problems with mixed Dirichlet-Neumann boundary conditions: isospectrality and beyond
• Drums That Sound the Same
• Equivalence between isospectrality and isolength spectrality for a certain class of planar billiard domains
• Eigenvectors of Random Graphs: Nodal Domains

Cited In (4)

• Nodal counting on quantum graphs
• A geometric construction of isospectral magnetic graphs
• 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)