Cospectral regular graphs with and without a perfect matching

Zoltan Blazsik; Jay Cummings; W. H. Haemers

doi:10.1016/j.disc.2014.11.002

Cospectral regular graphs with and without a perfect matching

Zoltan Blazsik
, Jay Cummings
, W. H. Haemers

Econometrics and OR

Research output: Contribution to journal › Article › Scientific › peer-review

11 Citations (Scopus)

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 language	English
Pages (from-to)	199-201
Journal	Discrete Mathematics
Volume	338
Issue number	3
DOIs	https://doi.org/10.1016/j.disc.2014.11.002
Publication status	Published - Mar 2015

Keywords

perfect matching
cospectral graphs
Godsil–McKay switching

Access to Document

10.1016/j.disc.2014.11.002

Cite this

@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 = mar,

doi = "10.1016/j.disc.2014.11.002",

language = "English",

volume = "338",

pages = "199--201",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "3",

}

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

SN - 0012-365X

VL - 338

SP - 199

EP - 201

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

Cospectral regular graphs with and without a perfect matching

Abstract

Keywords

Access to Document

Fingerprint

Cite this