Search

Let G be a simple connected graph of order n with degree sequence ( d, d, ..., d). Denote ( t) = Σ d, ( m) = ( t)/ d and ( N) = Σ ( t), where α is a real number. Denote by λ( G) and µ( G) the spectral radius of the adjacency matrix and the Laplacian matrix of G, respectively. In this paper, we present some upper and lower bounds of λ( G) and µ( G) in terms of ( t), ( m) and ( N). Furthermore, we also characterize some extreme graphs which attain these upper bounds. These results theoretically improve and generalize some known results. [ABSTRACT FROM AUTHOR]