Lower bounds for the eigenvalues of Laplacian matrices (Q1587270): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:10, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds for the eigenvalues of Laplacian matrices |
scientific article |
Statements
Lower bounds for the eigenvalues of Laplacian matrices (English)
0 references
18 April 2001
0 references
The isoperimetric number \(i_C(G)\) of the weighted graph \((G,C)\) is used to obtain a lower bound for the second smallest eigenvalue of the Laplacian matrices \(\lambda_2(L_C(G))\) (\(C\) is an \(n\times n\) symmetric nonnegative irreducible matrix). This, in turn, is applied to obtain an upper bound for the real parts of the nonmaximal eigenvalues of irreducible nonnegative matrices. Related results were also derived by \textit{F. R. K. Chung} [Spectral graph theory (1997; Zbl 0867.05046)], \textit{J. A. Fill} [Ann. Appl. Probab. 1, No. 1, 62-87 (1991; Zbl 0726.60069)], and \textit{B. Mohar} [NATO ASI, Ser. C 497, 225-275 (1997; Zbl 0883.05096)].
0 references
Laplacian matrices
0 references
weighted graphs
0 references
irreducible matrices
0 references
nonnegative matrices
0 references