A lower bound for the second largest Laplacian eigenvalue of weighted graphs

DOI10.13001/1081-3810.1501zbMath1252.05111OpenAlexW326579219MaRDI QIDQ3166939

Miriam Farber, Abraham Berman

Publication date: 1 November 2012

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a55e40eab26dd1469eb8a1a5e1b9836480010912

zbMATH Keywords

lower boundweighted graphLaplacian matrixsecond largest eigenvaluesignless LaplacianMerris graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Signed and weighted graphs (05C22)

Related Items (7)

A Unified Framework for Structured Graph Learning via Spectral Constraints ⋮ The relation between the diagonal entries and the eigenvalues of a symmetric matrix, based upon the sign pattern of its off-diagonal entries ⋮ Determinant and eigenvalue inequalities involving nonnegative matrices ⋮ Eigenvalues and diagonal elements ⋮ Statistical Analysis of Random Objects Via Metric Measure Laplacians ⋮ The inertia of weighted unicyclic graphs ⋮ On the Laplacian spectrum of \(k\)-uniform hypergraphs

This page was built for publication: A lower bound for the second largest Laplacian eigenvalue of weighted graphs