# Do perfect matching(s) have signatures in the graph eigenvalues?

If the edges of a bipartite graph are such that they can be seen as a disjoint union of perfect matchings then will this somehow reflect in the eigenvalues of the Laplacian?

It would be helpful to get any references which connect the concept of perfect matchings and graph eigenvalues...

Can something be said if the edges of the above bipartite graph decompose as a disjoint union of say $k$ perfect matchings and a part of another?

• Brouwer, Andries E., and Willem H. Haemers. "Eigenvalues and perfect matchings." Linear Algebra and its Applications 395 (2005): 155-162. Dec 5, 2014 at 8:49
• Google the article above, "Eigenvalues and perfect matchings", mentioned by Waldemar, to find a pdf copy of it on ResearchGate. Dec 5, 2014 at 13:58
• @Waldemar (and Ken W.Smith) Thanks for the reference. But this paper seems to go in the reverse direction than my question - right? Like this paper is a (sufficient) condition on the graph eigenvalues for a perfect matching to exist - but I want to know as to how does knowing the existence of perfect matchings help me with the eigenvalues.... Dec 5, 2014 at 16:11
• Isn't it well known that any regular bipartite graph can be decomposed into perfect matchings? May 17, 2018 at 14:08

• The quoted result still leaves open the question for the case of $r$-regular graphs, for $r=3,4$ (the case of $r=2$ being of course trivial). Dec 9, 2014 at 11:23
So, according to these results: if we have a 3-regular graph and the second largest eigenvalue is less than the largest root of $x^3 - 7x - 2 = 0$, then the graph is 2-edge-connected and it has a perfect matching.