Bounds for the spectral radius of a graph when nodes are removed

AbstractWe 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 12 (with equality for the star), appears as a special case of our more general result