2000 character limit reached
Isospectrality for graph Laplacians under the change of coupling at graph vertices: necessary and sufficient conditions
Published 20 May 2014 in math.SP, math-ph, and math.MP | (1405.5016v2)
Abstract: Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient conditions of isospectrality of two Laplacians defined on the same graph are derived and scrutinized. It is proved that the spectrum of a graph Laplacian uniquely determines matching conditions for "almost all" graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.