Cospectral regular graphs with and without a perfect matching
Combinatorics
2014-09-08 v2
Abstract
For each we construct a pair of cospectral -regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third author at the 22nd British Combinatorial Conference.
Cite
@article{arxiv.1409.0630,
title = {Cospectral regular graphs with and without a perfect matching},
author = {Zoltan L. Blazsik and Jay Cummings and Willem H. Haemers},
journal= {arXiv preprint arXiv:1409.0630},
year = {2014}
}