On the spectral radius of graphs with cut edges

AbstractWe study the spectral radius of graphs with n vertices and k cut edges. In this paper, we show that of all the connected graphs with n vertices and k cut edges, the maximal spectral radius is obtained uniquely at Knk, where Knk is a graph obtained by joining k independent vertices to one vertex of Kn−k. We also discuss the limit point of the maximal spectral radius