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

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

Research output: Contribution to journalArticleScientificpeer-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 languageEnglish
Pages (from-to)71-75
JournalDesigns Codes and Cryptography
Volume65
Issue number1-2
Publication statusPublished - 2012

Fingerprint

Interlacing
Graph in graph theory
Subgraph
Roots
Eigenvalue
Theorem
Form

Cite this

Blokhuis, A. ; Brouwer, A.E. ; Haemers, W.H. / The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9. In: Designs Codes and Cryptography. 2012 ; Vol. 65, No. 1-2. pp. 71-75.
@article{12a615bda1b44a4db283501f6081e258,
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.",
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 = "0925-1022",
publisher = "Springer Netherlands",
number = "1-2",

}

Blokhuis, A, Brouwer, AE & Haemers, WH 2012, 'The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9', Designs Codes and Cryptography, vol. 65, no. 1-2, pp. 71-75.

The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9. / Blokhuis, A.; Brouwer, A.E.; Haemers, W.H.

In: Designs Codes and Cryptography, Vol. 65, No. 1-2, 2012, p. 71-75.

Research output: Contribution to journalArticleScientificpeer-review

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

VL - 65

SP - 71

EP - 75

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

SN - 0925-1022

IS - 1-2

ER -