• Corpus ID: 245537169

Cospectral quantum graphs

@inproceedings{Chernyshenko2021CospectralQG,
  title={Cospectral quantum graphs},
  author={A. A. Chernyshenko and Vyacheslav Pivovarchik},
  year={2021}
}
Spectral problems are considered generated by the Sturm-Liouville equation on connected simple equilateral graphs with the Neumann and Dirichlet boundary conditions at the pendant vertices and continuity and Kirchhoff’s conditions at the interior vertices. We highlight the cases where the first and the second terms of the asymptotics of the eigenvalues uniquely determine the shape of the graph or of its interior subgraph. 

Distinguishing co-spectral quantum graphs by scattering

. We propose a simple method for resolution of co-spectrality of Schrödinger operators on metric graphs. Our approach consists of attaching a lead to them and comparing the S -functions of the

References

SHOWING 1-10 OF 27 REFERENCES

Recovering the Shape of a Quantum Graph

Sturm–Liouville problems on simple connected equilateral graphs of $$\le 5$$ ≤ 5 vertices and trees of $$\le 8$$ ≤ 8 vertices are considered with Kirchhoff’s and continuity conditions at the interior

On isospectral metric graphs

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

Spectral asymptotics for quantum graphs with equal edge lengths

If q is smooth on the edges of a finite metric graph with all edges of length one, the eigenvalues of the Schrödinger operator −D2 + q with standard vertex conditions have generalized asymptotic

Rayleigh estimates for differential operators on graphs

We study the spectral gap, i.e. the distance between the two lowest eigenvalues for Laplace operators on metric graphs. A universal lower estimate for the spectral gap is proven and it is shown that

Linear Representations and Isospectrality with Boundary Conditions

We present a method for constructing families of isospectral systems, using linear representations of finite groups. We focus on quantum graphs, for which we give a complete treatment. However, the

Can one hear the shape of a graph

We show that the spectrum of the Schroperator on a finite, metric graph determines uniquely the connectivity matrix and the bond lengths, provided that the lengths are non-commensurate and the

The spectrum of the continuous Laplacian on a graph

We study the spectrum of the continuous Laplacian Δ on a countable connected locally finite graph Γ without self-loops, whose edges have suitable positive conductances and are identified with copies

A duality between Schrödinger operators on graphs and certain Jacobi matrices

La correspondance bien connue entre le modele de Kronig-Penney et certaines matrices de Jacobi est generalisee a un large ensemble d'operateurs de Schrodinger sur les graphes. Nous presentons des

Generating isospectral but not isomorphic quantum graphs

Quantum graphs are defined by having a Laplacian defined on the edges a metric graph with boundary conditions on each vertex such that the resulting operator, L , is self-adjoint. We use Neumann

Schrödinger Operators on Graphs and Geometry II. Spectral Estimates for $${\varvec{L}}_\mathbf{1}$$L1-potentials and an Ambartsumian Theorem

In this paper we study Schrödinger operators with absolutely integrable potentials on metric graphs. Uniform bounds—i.e. depending only on the graph and the potential—on the difference between the