The graph with spectrum 14^1 2^40 (−4)^10 (−6)^9
Blokhuis,A. ; Brouwer,A.E. ; Haemers,W.H.
Blokhuis,A.
Brouwer,A.E.
Haemers,W.H.
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.
Description
Date
2012
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Blokhuis, A, Brouwer, A E & Haemers, W H 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. < http://www.springerlink.com/content/f286747076842806/ >
License
info:eu-repo/semantics/restrictedAccess
