We 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. © 2004 Elsevier Inc. All rights reserved.
Liu, H., Lu, M., & Tian, F. (2004). On the spectral radius of graphs with cut edges. Linear Algebra and Its Applications, 389(1–3), 139–145. https://doi.org/10.1016/j.laa.2004.03.026