๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Upper Bounds for the Laplacian Graph Eig
โœ Jiong Sheng Li; Yong Liang Pan ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Institute of Mathematics, Chinese Academy of Scien ๐ŸŒ English โš– 129 KB
Two sharp upper bounds for the Laplacian
โœ Xiao-Dong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 168 KB

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

Lower bounds for the eigenvalues of Lapl
โœ Abraham Berman; Xiao-Dong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 70 KB

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.