Eigenvalue comparison theorems of the discrete Laplacians for a graph (Q1282293)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1270427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eigenvalue comparison theorems of the discrete Laplacians for a graph |
scientific article; zbMATH DE number 1270427 |
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
0.7720352411270142
0 references
0.7716303467750549
0 references
