Abstract
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of and 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.