A structured inverse spectrum problem for infinite graphs

Abstract: It is shown that for a given infinite graph

G

on countably many vertices, and a compact, infinite set of real numbers

L a m b d a

there is a real symmetric matrix

A

whose graph is

G

and its spectrum is

L a m b d a

. Moreover, the set of limit points of

L a m b d a

equals the essential spectrum of

A

, and the isolated points of

L a m b d a

are eigenvalues of

A

with multiplicity one. It is also shown that any two such matrices constructed by our method are approximately unitarily equivalent.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: A structured inverse spectrum problem for infinite graphs