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

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

Research output: Contribution to journalArticleAcademicpeer-review

56 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 languageEnglish
Pages (from-to)71-75
Number of pages5
JournalDesigns, Codes and Cryptography
Volume65
Issue number1-2
DOIs
Publication statusPublished - 2012

Fingerprint Dive into the research topics of 'The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9'. Together they form a unique fingerprint.

Cite this