The Sharp Lower Bound for the Spectral Radius of Connected Graphs With the Independence Number

Abstract

In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize all extremal connected graphs which attain the minimum value among the spectral radii of all connected graphs with order n = kα and the independence number α. Moreover, all extremal graphs which attain the maximum value among the spectral radii of clique trees with order n = kα and the independence number α are characterized.