2004
DOI: 10.1088/0266-5611/20/3/002
|View full text |Cite
|
Sign up to set email alerts
|

Boundary spectral inverse problem on a class of graphs (trees) by the BC method

Abstract: A planar graph consisting of strings of variable densities is considered. The spectrum of the Dirichlet problem on the graph and the values of derivatives of the (normalized) eigenfunctions at the boundary vertices form the spectral data. We show that the graph without cycles (tree) and the densities of its edges are determined by the spectral data uniquely up to a natural isometry in the plane. In the framework of our approach (boundary control method; Belishev 1986) we study the boundary controllability of t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
135
0
4

Year Published

2006
2006
2020
2020

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 131 publications
(139 citation statements)
references
References 16 publications
0
135
0
4
Order By: Relevance
“…For second-order differential operators on compact graphs inverse spectral problems have been studied fairly completely in [3,4,25,28,[31][32][33] and other works. Inverse problems for higher-order differential operators on graphs were investigated in [29,30].…”
Section: Introductionmentioning
confidence: 99%
“…For second-order differential operators on compact graphs inverse spectral problems have been studied fairly completely in [3,4,25,28,[31][32][33] and other works. Inverse problems for higher-order differential operators on graphs were investigated in [29,30].…”
Section: Introductionmentioning
confidence: 99%
“…It is not a simple matter to move to branched cells, for in that case knowledge of the potential at two sites does not uniquely determine the desired conductance profile. Following Belishev (2004) it suffices to know the potential somewhere on each terminal branch. As these have small diameter and are difficult to patch onto one may have to turn to optical recordings, Meyer et al (1997).…”
Section: (218)mentioning
confidence: 99%
“…During the last years such problems were in the focus of intensive investigations. The most complete results on (both direct and inverse) spectral problems were achieved in the case of compact graphs [8], [7], [9], [10], [11], [12], [13]. In the noncompact case there are no similar general results since the presence of the noncompact edges (rays) leads to new qualitative difficulties in the investigation of the spectral problems.…”
Section: Introductionmentioning
confidence: 99%