Bounds on eigenvalues of Dirichlet Laplacian
โ Scribed by Qing-Ming Cheng; Hongcang Yang
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 207 KB
- Volume
- 337
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We give a lower bound for the second smallest eigenvalue of Laplacian matrices in terms of the isoperimetric number of weighted graphs. This is used to obtain an upper bound for the real parts of the nonmaximal eigenvalues of irreducible nonnegative matrices.
In this paper, we first obtain a sharp upper bound for the eigenvalues of the adjacency matrix of the line graph of a graph. Then this result is used to present a sharp upper bound for the Laplacian eigenvalues. Another sharp upper bound is presented also. Moreover, we determine all extreme graphs w
## Abstract It is shown that there exist domains ฮฉ โ โ^__N__^, which outside of some ball coincide with the strip โ^__N__ โ 1^ ร (0, ฯ) and for which the Dirichlet Laplacian โ ฮ has eigenvalues within the subinterval (1, 4) of the essential spectrum (1, โ).