arXiv Analytics

Sign in

arXiv:2001.08596 [math.CO]AbstractReferencesReviewsResources

Spectra of infinite graphs: two methods of computation

Leonid Golinskii

Published 2020-01-23Version 1

Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second method is related to the Schur complement for block matrices. A number of examples including infinite graphs with tails, chains of cycles and ladders are worked out in detail.

Related articles: Most relevant | Search more
arXiv:1503.04952 [math.CO] (Published 2015-03-17)
Spectra of infinite graphs with tails
arXiv:1508.05378 [math.CO] (Published 2015-08-21)
A Note On Immersion Intertwines Of Infinite Graphs
arXiv:1512.02911 [math.CO] (Published 2015-12-09)
The colouring number of infinite graphs