Interlacing for weighted graphs using the normalized Laplacian

DOI10.13001/1081-3810.1185zbMath1142.05334OpenAlexW2148780152MaRDI QIDQ3497874

Steve Butler

Publication date: 28 May 2008

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

Full work available at URL: https://eudml.org/doc/129116

zbMATH Keywords

Laplacian matrixinterlacingdirected Laplacianweak coverings

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (14)

Spectral preorder and perturbations of discrete weighted graphs ⋮ Matching number, Hamiltonian graphs and magnetic Laplacian matrices ⋮ Inertia indices and eigenvalue inequalities for Hermitian matrices ⋮ Interlacing inequalities for eigenvalues of discrete Laplace operators ⋮ Spectral analysis of non-Hermitian matrices and directed graphs ⋮ The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions ⋮ Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights ⋮ Multi-way dual Cheeger constants and spectral bounds of graphs ⋮ Markov chain methods for analyzing urban networks ⋮ Random walks and flights over connected graphs and complex networks ⋮ Eigenvalue conditions for induced subgraphs ⋮ Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets ⋮ A new eigenvalue bound for independent sets ⋮ Spectral distances on graphs

This page was built for publication: Interlacing for weighted graphs using the normalized Laplacian