A Structured Inverse Spectrum Problem for Infinite Graphs and Unbounded\n Operators

2017/08/04 by Ehssan Khanmohammadi, Khanmohammadi, Ehssan
Mathematics · #05C50 #05C63 #15A29 #47A10 #Combinatorics (math.CO) #FOS: Mathematics #Numerical methods in inverse problems #Spectral Theory (math.SP) #Spectral Theory in Mathematical Physics #advanced mathematical theories

paper · pdf · doi:10.48550/arxiv.1708.01708

openalex publication_date 2017/08/04 · openalex created_date 2022/10/01 · openalex updated_date 2026/08/04

Abstract

Given an infinite graph G on countably many vertices, and a closed,\ninfinite set \Λ of real numbers, we prove the existence of an unbounded\nself-adjoint operator whose graph is G and whose spectrum is \Λ.\n

Related

• A Structured Inverse Spectrum Problem For Infinite Graphs
• Spectra of infinite graphs: two methods of computation
• Isospectral Reduction in Infinite Graphs
• Spectral multiplicity functions of adjacency operators of graphs and cospectral infinite graphs
• Harmonic analysis invariants for infinite graphs via operators and\n algorithms