We give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenvalues of the Laplacian matrix. We also show that a distance-regular graph of degree k is k-edge-connected