Cospectral regular graphs with and without a perfect matching

Zoltan L. Blazsik, Jay Cummings, Willem H. Haemers

For each $b\ge 5$ we construct a pair of cospectral $b$-regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third…