Spectral radius and degree sequence of a graph

Let G be a simple connected graph of order n with degree sequence in non-increasing order. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer ℓ at most n, we give a sharp upper bound for ρ(G) by a function of which generalizes a series of previous results.