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

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

doi:10.1007/s10623-011-9529-6

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

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

Discrete Algebra and Geometry

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

210 Downloads (Pure)

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. Keywords: Graph spectrum – Strongly regular graph – Root lattice

Original language	English
Pages (from-to)	71-75
Number of pages	5
Journal	Designs, Codes and Cryptography
Volume	65
Issue number	1-2
DOIs	https://doi.org/10.1007/s10623-011-9529-6
Publication status	Published - 2012

Access to Document

10.1007/s10623-011-9529-6

Metis254312Final published version, 125 KB
915169090214212Final published version, 114 KB

Cite this

@article{3287ce601236463fbf191c989a95917f,

title = "The graph with spectrum 14^1 2^40 (−4)^10 (−6)^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. Keywords: Graph spectrum – Strongly regular graph – Root lattice",

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

year = "2012",

doi = "10.1007/s10623-011-9529-6",

language = "English",

volume = "65",

pages = "71--75",

journal = "Designs, Codes and Cryptography",

issn = "0925-1022",

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. Keywords: Graph spectrum – Strongly regular graph – Root lattice

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. Keywords: Graph spectrum – Strongly regular graph – Root lattice

U2 - 10.1007/s10623-011-9529-6

DO - 10.1007/s10623-011-9529-6

M3 - Article

SN - 0925-1022

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