2005
DOI: 10.1016/j.cam.2004.11.038
|View full text |Cite
|
Sign up to set email alerts
|

Eigenvalue asymptotics for differential operators on graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 17 publications
(19 citation statements)
references
References 4 publications
0
19
0
Order By: Relevance
“…/ and c. , a/ coincide. This implies relations (16). Moreover, it is known ( [20]) that c. , a/ is an even entire function of exponential type having the form…”
Section: Lemma 31mentioning
confidence: 90%
See 2 more Smart Citations
“…/ and c. , a/ coincide. This implies relations (16). Moreover, it is known ( [20]) that c. , a/ is an even entire function of exponential type having the form…”
Section: Lemma 31mentioning
confidence: 90%
“…Note that scriptL is a self‐adjoint operator in H (). Because all the edges are of finite length and the real function q ∈ L 2 (0, a ), the spectrum of scriptL is discrete, that is, it consists of eigenvalues with infinity as the only accumulation point.…”
Section: Spectral Problem and Differential Operatormentioning
confidence: 99%
See 1 more Smart Citation
“…In [7] it was shown that a formally self-adjoint boundary value problem on a graph, with K edges, denoted e i for i = 1, . .…”
Section: The M-matrix and The Matrix Prüfer Anglementioning
confidence: 99%
“…In this paper we make use of the fact that a self-adjoint boundary value problem on a graph can be reformulated as a self-adjoint boundary value problem for a system on [0, 1] with separated boundary conditions, see [7]. The Titchmarsh-Weyl M-matrix is defined in Section 2, where, in addition, it is shown that the M-matrix exists and is well-defined.…”
Section: Introductionmentioning
confidence: 97%