Sharp upper bounds on the spectral radius of graphs

Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 d2 dn. The spectral radius ρ(G) of graph G is the largest eigenvalue of its adjacency matrix. In this paper, we present some sharp upper bounds of the spectral radius in terms of the degree sequence of graphs.