Lower bounds for the first eigenvalue of certain M-matrices associated with graphs

DOI10.1016/0024-3795(92)90019-7zbMath0784.15010OpenAlexW2008671467MaRDI QIDQ1194509

Shmuel Friedland

Publication date: 27 September 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90019-7

zbMATH Keywords

convergence rateLaplaciansmallest eigenvaluelower bounds\(M\)-matricesirreducible diagonally symmetrizable stochastic matricesnonnegative irreducible symmetric matricesundirected connected multigraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Iterative numerical methods for linear systems (65F10)

Related Items (9)

An estimate for the nonstochastic eigenvalues of doubly stochastic matrices ⋮ On Spectral Integral Variations of Graphs ⋮ Spectral bounds of directed Cayley graphs of finite groups ⋮ On spectral integral variations of mixed graphs ⋮ On the second real eigenvalue of nonegative and Z-matrices ⋮ Schur complements and its applications to symmetric nonnegative and \(Z\)-matrices ⋮ Lower bounds for the eigenvalues of Laplacian matrices ⋮ On the Perron roots of principal submatrices of co-order one of irreducible nonnegative matrices ⋮ Laplacian matrices of graphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
• Eigenvalues and expanders
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks

This page was built for publication: Lower bounds for the first eigenvalue of certain M-matrices associated with graphs