On isospectral metric graphs
Abstract
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of graphs is obtained by gluing together subgraphs with the Steklov maps possessing special properties. It turns out that isospectrality is related to the degeneracy of the Steklov eigenvalues.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.