Cospectral regular graphs with and without a perfect matching

Zoltán L Blázsik; Jay Cummings; Willem H Haemers

doi:10.1016/j.disc.2014.11.002

Back

Cospectral regular graphs with and without a perfect matching

Journal article

Open access

Peer reviewed

Cospectral regular graphs with and without a perfect matching

Zoltán L Blázsik, Jay Cummings and Willem H Haemers

Discrete mathematics, Vol.338(3), pp.199-201

03/06/2015

DOI: https://doi.org/10.1016/j.disc.2014.11.002

Handle:

https://hdl.handle.net/20.500.12741/rep:7928

Abstract

Perfect matching

Godsil–McKay switching

Cospectral graphs

For each b≥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.

Files and links (1)

url

https://doi.org/10.1016/j.disc.2014.11.002View

Published (Version of record) Open

Metrics

9 Record Views

Details

Title: Cospectral regular graphs with and without a perfect matching
Creators: Zoltán L Blázsik - Department of Computer Science, Eötvös University, Budapest, Hungary
Jay Cummings - Department of Mathematics, University of California, San Diego, USA
Willem H Haemers - Department of Econometrics and O.R., Tilburg University, Tilburg, The Netherlands
Academic Unit: Mathematics/Statistics Department
Publisher: Elsevier B.V
Publication Details: 03/06/2015
Identifiers: 99257880254301671; https://hdl.handle.net/20.500.12741/rep:7928; https://doi.org/10.1016/j.disc.2014.11.002
Language: English