The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9

A. Blokhuis; A.E. Brouwer; W.H. Haemers

The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9

A. Blokhuis
, A.E. Brouwer
, W.H. Haemers

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

Abstract

We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughlin graph. The proof uses a strong form of the eigenvalue interlacing theorem to reduce the problem to one about root lattices.

Original language	English
Pages (from-to)	71-75
Journal	Designs Codes and Cryptography
Volume	65
Issue number	1-2
Publication status	Published - 2012

Access to Document

http://www.springerlink.com/content/f286747076842806/

Cite this

@article{12a615bda1b44a4db283501f6081e258,

title = "The graph with spectrum 14\textasciicircum{}1 2\textasciicircum{}40 (−4)\textasciicircum{}10 (−6)\textasciicircum{}9",

abstract = "We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughlin graph. The proof uses a strong form of the eigenvalue interlacing theorem to reduce the problem to one about root lattices.",

author = "A. Blokhuis and A.E. Brouwer and W.H. Haemers",

year = "2012",

language = "English",

volume = "65",

pages = "71--75",

journal = "Designs Codes and Cryptography",

issn = "1573-7586",

publisher = "Springer Netherlands",

number = "1-2",

}

TY - JOUR

T1 - The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9

AU - Blokhuis, A.

AU - Brouwer, A.E.

AU - Haemers, W.H.

PY - 2012

Y1 - 2012

N2 - We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughlin graph. The proof uses a strong form of the eigenvalue interlacing theorem to reduce the problem to one about root lattices.

AB - We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughlin graph. The proof uses a strong form of the eigenvalue interlacing theorem to reduce the problem to one about root lattices.

M3 - Article

SN - 1573-7586

VL - 65

SP - 71

EP - 75

JO - Designs Codes and Cryptography

JF - Designs Codes and Cryptography

IS - 1-2

ER -

The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9

Abstract

Access to Document

Fingerprint

Cite this