On the distance spectral radius of bipartite graphs

In this paper, we determine the unique graph with minimum distance spectral radius among all connected bipartite graphs of order $n$ with a given matching number. Moreover, we characterize the graphs with minimal distance spectral radius in the class of all connected bipartite graphs with a given vertex connectivity.