Some Lower Bounds on the Spectral Radius of Graphs

Abstract

Let \(G\) be a simple connected graph. The spectral radius \(\rho(G)\) of \(G\) is the largest eigenvalue of its adjacency matrix. In this paper, we obtain two lower bounds of \(\rho(G)\) by two different methods, one of which is better than another in some conditions.