Cospectral regular graphs with and without a perfect matching

Zoltan Blazsik, Jay Cummings, W. H. Haemers

Research output: Contribution to journalArticleScientificpeer-review

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.
Original languageEnglish
Pages (from-to)199-201
JournalDiscrete Mathematics
Volume338
Issue number3
DOIs
Publication statusPublished - Mar 2015

Fingerprint

Cospectral Graphs
Perfect Matching
Regular Graph

Keywords

  • perfect matching
  • cospectral graphs
  • Godsil–McKay switching

Cite this

Blazsik, Zoltan ; Cummings, Jay ; Haemers, W. H. / Cospectral regular graphs with and without a perfect matching. In: Discrete Mathematics. 2015 ; Vol. 338, No. 3. pp. 199-201.
@article{3c2404d7cb7e4afc9d9c8662059ced76,
title = "Cospectral regular graphs with and without a perfect matching",
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.",
keywords = "perfect matching, cospectral graphs, Godsil–McKay switching",
author = "Zoltan Blazsik and Jay Cummings and Haemers, {W. H.}",
year = "2015",
month = "3",
doi = "10.1016/j.disc.2014.11.002",
language = "English",
volume = "338",
pages = "199--201",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "3",

}

Cospectral regular graphs with and without a perfect matching. / Blazsik, Zoltan; Cummings, Jay; Haemers, W. H.

In: Discrete Mathematics, Vol. 338, No. 3, 03.2015, p. 199-201.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Cospectral regular graphs with and without a perfect matching

AU - Blazsik, Zoltan

AU - Cummings, Jay

AU - Haemers, W. H.

PY - 2015/3

Y1 - 2015/3

N2 - 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.

AB - 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.

KW - perfect matching

KW - cospectral graphs

KW - Godsil–McKay switching

U2 - 10.1016/j.disc.2014.11.002

DO - 10.1016/j.disc.2014.11.002

M3 - Article

VL - 338

SP - 199

EP - 201

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 3

ER -