Interlacing eigenvalues on some operations of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A short proof of interlacing inequalities on normalized Laplacians
- An Interlacing Result on Normalized Laplacians
- On the index of cactuses with n vertices
- On the spectral radius of graphs with cut edges
- The Laplacian spectral radius of a graph under perturbation
- The Laplacian spectral radius of some bipartite graphs
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- The spectral radius of trees on \(k\) pendant vertices
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
Cited in
(12)- Some Minimal Graphs by Interlacing Eigenvalues
- scientific article; zbMATH DE number 5583324 (Why is no real title available?)
- The second smallest normalized Laplacian eigenvalue of unicyclic graphs
- Effects on the normalized Laplacian spectral radius of non-bipartite graphs under perturbation and their applications
- Interlacing for weighted graphs using the normalized Laplacian
- Positive and negative square energies of graphs
- An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
- Graphs and Hermitian matrices: eigenvalue interlacing
- Edge-matching graph contractions and their interlacing properties
- Interlacing results on matrices associated with graphs
- Interlacing inequalities for eigenvalues of discrete Laplace operators
- Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights
This page was built for publication: Interlacing eigenvalues on some operations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999795)