1 paper
Yuke Zhang, Huiqiu Lin
A perfect matching in a graph G is a set of nonadjacent edges covering every vertex of G. Motivated by recent progress on the relations between the eigenvalues and the matching…