The inverse scattering problem for metric graphs and the traveling salesman problem
From MaRDI portal
Publication:6469657
arXivmath-ph/0603010MaRDI QIDQ6469657FDOQ6469657
Authors: Vadim Kostrykin, Robert Schrader 
Publication date: 2 March 2006
Abstract: We present a solution to the inverse scattering problem for differential Laplace operators on metric noncompact graphs. We prove that for almost all boundary conditions (i) the scattering matrix uniquely determines the graph and its metric structure, (ii) the boundary conditions are determined uniquely up to trivial gauge transformations. The main ingredient of our approach is a combinatorial Fourier expansion of the scattering matrix which encodes the topology of the graph into analytic properties of the scattering matrix. Using the technique developed in this work, we also propose an analytic approach to solving some combinatorial problems on graphs, in particular, the Traveling Salesman Problem.
Extremal problems in graph theory (05C35) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Scattering theory of linear operators (47A40)
This page was built for publication: The inverse scattering problem for metric graphs and the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6469657)
