Note on deleting a vertex and weak interlacing of the Laplacian spectrum
From MaRDI portal
Publication:3497872
Recommendations
- Deleting vertices and interlacing Laplacian eigenvalues
- Interlacing results on matrices associated with graphs
- A short proof of interlacing inequalities on normalized Laplacians
- Deleting vertices and interlacing of A_ eigenvalues of a graph
- The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector
Cited in
(14)- Some results on the Laplacian eigenvalues of unicyclic graphs
- Interlacing inequalities for eigenvalues of discrete Laplace operators
- Analysis of centrality measures under differential privacy models
- Deleting vertices and interlacing Laplacian eigenvalues
- Some graphs determined by their (signless) Laplacian spectra.
- Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph
- Nonlinear consensus on networks: equilibria, effective resistance, and trees of motifs
- Deleting vertices and interlacing of A_ eigenvalues of a graph
- Monster graphs are determined by their Laplacian spectra
- Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
- Determination of particular double starlike trees by the Laplacian spectrum
- Deletion-contraction for a unified Laplacian and applications
- The coalescence of multi-wheel and starlike graphs is DLS
- On interlacing of net-Laplacian and normalized net-Laplacian eigenvalues of signed graphs
This page was built for publication: Note on deleting a vertex and weak interlacing of the Laplacian spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497872)