Conformal upper bounds for the eigenvalues of the Laplacian and Steklov problem
โ Scribed by Asma Hassannezhad
- Book ID
- 113710121
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 181 KB
- Volume
- 261
- Category
- Article
- ISSN
- 0022-1236
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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.