Maxima of spectral radius of irregular graphs with given maximum degree

Abstract

Let λ* be the maximum spectral radius of connected irregular graphs on n vertices with maximum degree . Liu, Shen and Wang (2007) conjectured that n→ ∞(n2(-λ*))/(-1)=π2, which describes the asymptotic behavior for the maximum spectral radius of irregular graphs. Focusing on this conjecture, we consider the maximum spectral radius of connected subcubic bipartite graphs. The unique connected subcubic bipartite graph with the maximum spectral radius is determined. Let G be a k-connected irregular graph with spectral radius λ1(G), we present a lower bound for -λ1(G). Moreover, if H is a proper subgraph of a k-connected -regular graph, a lower bound for -λ1(H) is also obtained. These bounds improve some previous results.