On adjacency operators of locally finite graphs

A graph Gamma is called locally finite if, for each vertex v is an element of Gamma, the set Gamma(v) of its adjacent vertices is finite. For an arbitrary locally finite graph G with vertex set V (Gamma) and an arbitrary field F, let F-V(Gamma) be the vector space over F of all functions V (Gamma) -> F (with natural componentwise operations) and let A(Gamma,F)((alg)) be the linear operator F-V(Gamma) -> F-V(Gamma) defined by (A(Gamma,F)((alg)) (f))(v) = Sigma(u is an element of Gamma(v)) f(u) for all f is an element of F-V(Gamma), v is an element of V (Gamma). In the case of a finite graph G, the mapping A(Gamma,F)((alg)) is the well-known operator defined by the adjacency matrix of the graph Gamma (over F), and the theory of eigenvalues and eigenfunctions of such operators is a well developed part of the theory of finite graphs (at least, in the case F = C). In the present paper, we develop the theory of eigenvalues and eigenfunctions of the operators A(Gamma,F)((alg)) for infinite locally finite graphs G (however, some results that follow may present certain interest for the theory of finite graphs) and arbitrary fields F, even though in the present paper special emphasis is placed on the case of a connected graph G with uniformly bounded degrees of vertices and F = C. The previous attempts in this direction were not, in the author's opinion, quite satisfactory in the sense that they have been concerned only with eigenfunctions (and corresponding eigenvalues) of rather special type.