The inverse scattering problem for metric graphs and the traveling salesman problem

Details The inverse scattering problem for metric graphs and the traveling salesman problem The inverse scattering problem for metric graphs and the traveling salesman problem

2006-03-02

arxiv.org/abs/math-ph/0603010v1

Physics

Mathematical Physics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The inverse scattering problem for metric graphs and the traveling salesman problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The inverse scattering problem for metric graphs and the traveling salesman problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The inverse scattering problem for metric graphs and the traveling salesman problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-118646