Cospectral regular graphs with and without a perfect matching
classification
🧮 math.CO
keywords
cospectralgraphsmatchingperfectregularauthorbritishcombinatorial
read the original abstract
For each $b \geq 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 author at the 22nd British Combinatorial Conference.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.