In this paper, we obtain the largest Laplacian spectral radius for bipartite graphs with given matching number and use them to characterize the extremal general graphs.
