Bounds for the spectral radius of a graph when nodes are removed
From MaRDI portal
Publication:417595
DOI10.1016/J.LAA.2012.02.023zbMATH Open1241.05081OpenAlexW1972183931MaRDI QIDQ417595FDOQ417595
Authors: Cong Li, Huijuan Wang, Piet Van Mieghem 
Publication date: 14 May 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.02.023
Recommendations
- A bound for the Aα-spectral radius of a connected graph after vertex deletion
- A bound on the spectral radius of graphs
- A note on the bounds for the spectral radius of graphs
- Bounds of the spectral radius of connected graphs
- Bounds of the spectral radius of connected graphs
- Bounds on the (Laplacian) spectral radius of graphs
- Bounds for the Laplacian spectral radius of graphs
- Bounds for the Laplacian spectral radius of graphs
- scientific article; zbMATH DE number 1877024
- On the spectral radius of graphs
Cites Work
- Graph spectra for complex networks
- Principal eigenvectors of irregular graphs
- The largest eigenvalue of nonregular graphs
- Extreme eigenvalues of nonregular graphs
- The spectral radius of irregular graphs
- The spectral radius and the maximum degree of irregular graphs
- On the largest eigenvalue of non-regular graphs
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
Cited In (7)
- A bound for the Aα-spectral radius of a connected graph after vertex deletion
- A conjecture on the spectral radius of graphs
- On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
- Spectral characterization of the complete graph removing a path
- Title not available (Why is that?)
- Complementarity eigenvalue analysis of connected graphs
- Bounds for graph regularity and removal lemmas
This page was built for publication: Bounds for the spectral radius of a graph when nodes are removed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417595)
