UPPER BOUND ON SPECTRAL RADIUS OF GRAPHS

Let G be a simple connected graph with n vertices and ρ(G) be the adjacency spectral radius of G. By using algebraic techniques, this paper presents the upper bound of ρ(G) and the extreme graphs arriving this bound, thus we improve the results in [1][2].