Bounds for the spectral radius of a graph when nodes are removed
From MaRDI portal
Publication:417595
DOI10.1016/j.laa.2012.02.023zbMath1241.05081OpenAlexW1972183931MaRDI QIDQ417595
Hui-Juan Wang, Cong Li, 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
Related Items (4)
A conjecture on the spectral radius of graphs ⋮ On least eigenvalues and least eigenvectors of real symmetric matrices and graphs ⋮ Complementarity eigenvalue analysis of connected graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Extreme eigenvalues of nonregular graphs
- The spectral radius of irregular graphs
- The largest eigenvalue of nonregular 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
This page was built for publication: Bounds for the spectral radius of a graph when nodes are removed
