On the spectral radius of bipartite graphs with given diameter

Let GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper characterizes the extremal graph with the maximal spectral radius in GB(n,d). Furthermore, the maximal spectral radius is a decreasing function on d. At last, bipartite graphs with the second largest spectral radius are determined.