2017
DOI: 10.12693/aphyspola.132.1699
|View full text |Cite
|
Sign up to set email alerts
|

Edge Switching Transformations of Quantum Graphs

Abstract: Discussed here are the effects of basics graph transformations on the spectra of associated quantum graphs. In particular it is shown that under an edge switch the spectrum of the transformed Schrödinger operator is interlaced with that of the original one. By implication, under edge swap the spectra before and after the transformation, denoted by {En} ∞ n=1 and { En} ∞ n=1 correspondingly, are level-2 interlaced, so that En−2 ≤ En ≤ En+2. The proofs are guided by considerations of the quantum graphs' discrete… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

2
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 24 publications
(33 reference statements)
2
6
0
Order By: Relevance
“…The need to consider this problem came from a seemingly unrelated subject, namely the response of the spectra of quantum graphs to changes of the lengths of edges while keeping constant the connectivity of the graph and the boundary conditions at the vertices. Previous theoretical work on quantum graphs [9][10][11] has shown that the exchange of lengths of pairs of edges results in the interlacing of the spectra in agreement with Weyl's rule. Namely, the n-th eigenvalue of the graph with exchanged lengths is bounded from below and above by the original eigenvalues with quantum numbers n − 2 and n + 2, respectively.…”
Section: Introductionsupporting
confidence: 55%
“…The need to consider this problem came from a seemingly unrelated subject, namely the response of the spectra of quantum graphs to changes of the lengths of edges while keeping constant the connectivity of the graph and the boundary conditions at the vertices. Previous theoretical work on quantum graphs [9][10][11] has shown that the exchange of lengths of pairs of edges results in the interlacing of the spectra in agreement with Weyl's rule. Namely, the n-th eigenvalue of the graph with exchanged lengths is bounded from below and above by the original eigenvalues with quantum numbers n − 2 and n + 2, respectively.…”
Section: Introductionsupporting
confidence: 55%
“…3 we show the experimental distribution of the spectral shift P (∆N) compared to the numerical results obtained for a tetrahedral graph analyzed in Ref. [41]. The experimental results in Fig.…”
Section: Introductionmentioning
confidence: 84%
“…Different transformations of a quantum graph, e.g., an edge switch and an edge swap have an impact on the spectrum [41]. The first of these transformations does not necessary preserve a graph topology while in the second modification the topology of a graph is preserved.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore it appears important to study behaviour of the spectrum under the change of the metric graph. Different transformations of the underlying metric graph have been considered [3][4][5][6][7][8][9][10][11]. Our goal today is to understand what happens to the spectrum if the graph is cut into two or more pieces or if two or more graphs are glued into one.…”
Section: Introductionmentioning
confidence: 99%