Let G be a connected graph. The first and the second largest distance signless Laplacian eigenvalues of G are denoted by (Formula presented.) and (Formula presented.). In this paper, we determine the graphs with the minimum (Formula presented.) among n-vertex graphs with given matching number. We also establish sharp lower bounds on (Formula presented.) in terms of the order and the matching number of G. Moreover, the unique graph with the minimum (Formula presented.) among the n-vertex connected graphs with fixed connectivity is iden...
