| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4601029 | Linear Algebra and its Applications | 2012 | 5 Pages |
Abstract
We present a new type of lower bound for the spectral radius of a graph in which m nodes are removed. As a corollary, Cioabă’s theorem [4], which states that the maximum normalized principal eigenvector component in any graph never exceeds (with equality for the star), appears as a special case of our more general result.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
