Eigenvalue comparison theorems of the discrete Laplacians for a graph
The author gives a graph theoretic version of Cheng's eigenvalue comparison theorems for the Laplacian on complete Riemannian manifolds. He also determines the infimum of the essential spectrum of the discrete Laplacian on infinite graphs.
scientific article; zbMATH DE number 1270427