Inverse problems on graphs: recovering the tree of strings by the BC-method
From MaRDI portal
Recommendations
- On inverse problem for tree of Stieltjes strings
- Boundary spectral inverse problem on a class of graphs (trees) by the BC method
- On inverse problems for finite trees
- A Calderón type inverse problem for tree graphs
- On the inverse problem of the two-velocity tree-like graph
- Inverse problems in graph theory: nets
- Inverse problems in the theory of distance-regular graphs
- On an extremal inverse problem in graph theory
- On an inverse problem for tree-like networks of elastic strings
- The inverse Voronoi problem in graphs. II: Trees
Cites work
Cited in
(39)- Inverse dynamic and spectral problems for the one-dimensional Dirac system on a finite tree
- On inverse dynamical and spectral problems for the wave and Schrödinger equations on finite trees. The leaf peeling method
- An inverse problem for quantum trees with observations at interior vertices
- Exact controllability of the 1-d wave equation on finite metric tree graphs
- Exact controllability of the wave equation on graphs
- Spectral data characterization for the Sturm-Liouville operator on the star-shaped graph
- Controllability for a string with attached masses and Riesz bases for asymmetric spaces
- Blockage detection in networks: the area reconstruction method
- Dirichlet-Neumann inverse spectral problem for a star graph of Stieltjes strings
- Recovering differential pencils on compact graphs
- Determining a distributed conductance parameter for a neuronal cable model defined on a tree graph
- Method for solving inverse spectral problems on quantum star graphs
- On the inverse problem of the two-velocity tree-like graph
- Can one distinguish quantum trees from the boundary?
- Isospectrality for graph Laplacians under the change of coupling at graph vertices
- On inverse topology problem for Laplace operators on graphs
- Topological derivatives for networks of elastic strings
- Boundary spectral inverse problem on a class of graphs (trees) by the BC method
- Isospectrality for graph Laplacians under the change of coupling at graph vertices: necessary and sufficient conditions
- Inverse problems for Aharonov-Bohm rings
- On revealing graph cycles via boundary measurements
- Aharonov-Bohm ring touching a quantum wire: how to model it and to solve the inverse problem
- Boundary control and tomography of Riemannian manifolds (the BC-method)
- Boundary inverse problems for networks of vibrating strings with attached masses
- A C^-algebra associated with dynamics on a graph of strings
- Determining distributed parameters in a neuronal cable model on a tree graph
- Inverse scattering for lasso graph
- Gelfand's inverse problem for the graph Laplacian
- Synthesis of a quantum tree Weyl matrix
- Recovery of a potential on a quantum star graph from Weyl's matrix
- Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs
- Some inverse scattering problems on star-shaped graphs
- Stability of the inverse Sturm-Liouville problem on a quantum tree
- Carleman-based reconstruction algorithm on a wave network
- Determination of discontinuous diffusion coefficients for the heat equation on a tree-shaped network
- Vertex weight reconstruction in the Gel'fand's inverse problem on connected weighted graphs
- Discrete dynamical systems: inverse problems and related topics
- Synthesis of the Weyl matrix on the square lattice
- Stability of the inverse Sturm-Liouville problem on a graph with a cycle
This page was built for publication: Inverse problems on graphs: recovering the tree of strings by the BC-method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479016)
