Interlacing for weighted graphs using the normalized Laplacian
From MaRDI portal
Publication:3497874
Recommendations
Cited in
(24)- Eigenvalue interlacing and weight parameters of graphs
- Interlacing inequalities for eigenvalues of discrete Laplace operators
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- Spectral preorder and perturbations of discrete weighted graphs
- Matching number, Hamiltonian graphs and magnetic Laplacian matrices
- Spectral analysis of non-Hermitian matrices and directed graphs
- Eigenvalue conditions for induced subgraphs
- A new eigenvalue bound for independent sets
- Spectral distances on graphs
- Deleting vertices and interlacing Laplacian eigenvalues
- 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
- On the connection between the eigen-vectors of weighted graphs and their subgraphs
- Interlacing results on matrices associated with graphs
- Normalized graph Laplacians for directed graphs
- An Interlacing Result on Normalized Laplacians
- Multi-way dual Cheeger constants and spectral bounds of graphs
- Inertia indices and eigenvalue inequalities for Hermitian matrices
- Deletion-contraction for a unified Laplacian and applications
- Unified approach for spectral properties of weighted adjacency matrices for graphs with degree-based edge-weights
- Normalized Laplacian eigenvalues of hypergraphs
- Spectra of complex unit hypergraphs
- Random walks and flights over connected graphs and complex networks
- Markov chain methods for analyzing urban networks
This page was built for publication: Interlacing for weighted graphs using the normalized Laplacian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497874)