The maximum spectral radius of irregular bipartite graphs.

A bipartite graph is subcubic if it is an irregular bipartite graph with maximum degree three. In this paper, we prove that the asymptotic value of maximum spectral radius over subcubic bipartite graphs of order n is 3 − Θ ( π 2 n 2 ). Our key approach is taking full advantage of the eigenvalues of a certain tridiagonal matrix, due to Willms [SIAM J. Matrix Anal. Appl. 30 (2008) 639–656]. Moreover, for large maximum degree, i.e., the maximum degree is at least ⌊ n / 2 ⌋ , we characterize irregular bipartite graphs with maximum spectral radius. For general maximum degree, we present an upper bound on the spectral radius of irregular bipartite graphs in terms of the order and maximum degree. [ABSTRACT FROM AUTHOR]