Cospectral trees indistinguishable by scattering
From MaRDI portal
Cites work
- Can one hear the shape of a graph?
- Can one hear the shape of a network?
- Characteristic functions of quantum graphs
- Cospectral quantum graphs with Dirichlet conditions at pendant vertices
- Direct and Inverse Finite-Dimensional Spectral Problems on Graphs
- Distinguishing cospectral quantum graphs by scattering
- Isospectral graphs via inner symmetries
- Rayleigh estimates for differential operators on graphs
- Recovering the shape of a quantum graph
- Recovering the shape of a quantum tree by two spectra
- Recovering the shape of an equilateral quantum tree with the Dirichlet conditions at the pendant vertices
This page was built for publication: Cospectral trees indistinguishable by scattering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6948644)