Nodal domains on isospectral quantum graphs: the resolution of isospectrality?

DOI10.1088/0305-4470/39/45/009zbMATH Open1111.58027arXivnlin/0608031OpenAlexW3100860038MaRDI QIDQ3419352FDOQ3419352

Authors: R. Band, Talia Shapira, Uzy Smilansky 

Publication date: 6 February 2007

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

Abstract: We present and discuss isospectral quantum graphs which are not isometric. These graphs are the analogues of the isospectral domains in R2 which were introduced recently and are all based on Sunada's construction of isospectral domains. After presenting some of the properties of these graphs, we discuss a few examples which support the conjecture that by counting the nodal domains of the corresponding eigenfunctions one can resolve the isospectral ambiguity.

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

Recommendations

• Quantum graphs which sound the same
• Isospectral graphs with identical nodal counts
• Isospectral discrete and quantum graphs with the same flip counts and nodal counts
• Resolving isospectral ‘drums’ by counting nodal domains
• The isospectral fruits of representation theory: quantum graphs and drums

zbMATH Keywords

quantum graphsisospectrality

Mathematics Subject Classification ID

Isospectrality (58J53)

Cited In (23)

• Dynamics of nodal points and the nodal count on a family of quantum graphs
• The number of nodal domains on quantum graphs as a stability index of graph partitions
• On the quotient quantum graph with respect to the regular representation
• Comment on ‘Resolving isospectral ‘drums’ by counting nodal domains’
• Torsional rigidity, isospectrality and quantum graphs
• Distinguishing cospectral quantum graphs by scattering
• The \(L^2\)-strong maximum principle on arbitrary countable networks
• Quantum graphs which sound the same
• Isospectral graphs with identical nodal counts
• Isospectral discrete and quantum graphs with the same flip counts and nodal counts
• Quasi-isospectrality on quantum graphs
• Linear representations and isospectrality with boundary conditions
• On the nodal count for flat tori
• Resolving isospectral ‘drums’ by counting nodal domains
• An elementary introduction to quantum graphs
• On Pleijel's nodal domain theorem for quantum graphs
• Nodal statistics on quantum graphs
• A lower bound for nodal count on discrete and metric graphs
• Neumann domains on quantum graphs
• Concrete method for recovering the Euler characteristic of quantum graphs
• Quantum graphs via exercises
• The isospectral fruits of representation theory: quantum graphs and drums
• Scattering from isospectral quantum graphs

This page was built for publication: Nodal domains on isospectral quantum graphs: the resolution of isospectrality?

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