Eigenvalue comparison theorems of the discrete Laplacians for a graph (Q1282293)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eigenvalue comparison theorems of the discrete Laplacians for a graph |
scientific article |
Statements
Eigenvalue comparison theorems of the discrete Laplacians for a graph (English)
0 references
26 September 1999
0 references
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.
0 references
first eigenvalue
0 references
Laplacian
0 references
infinite graphs
0 references
Cheng's theorem
0 references
