A note on connected bipartite graphs of fixed order and size with maximal index

In this paper the unique graph with maximal index (i.e. the largest eigenvalue of the adjacency matrix) is identified among all connected bipartite graphs of order n   and size n+kn+k, under the assumption that k≥0k≥0 and n≥k+5n≥k+5.