October 2012, Volume 65, Issue 1-2, pp 71-75,
Open Access This content is freely available online to anyone, anywhere at any time.
Date: 14 Jun 2011
The graph with spectrum 141 240 (−4)10 (−6)9
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.
This is one of several papers published together in Designs, Codes and Cryptography on the special topic: “Geometric and Algebraic Combinatorics”.
- Brouwer, A.E., Haemers, W.H. (1992) Structure and uniqueness of the (81,20,1,6) strongly regular graph. Discrete Math. 106/107: pp. 77-82 CrossRef
- Brouwer, A.E., Cohen, A.M., Neumaier, A. (1989) Distance-Regular Graphs. Springer, Heidelberg
- Dam, E.R., Haemers, W.H. (2003) Which graphs are determined by their spectrum? Linear Algebra Appl. 373: pp. 241-272
- Dam, E.R., Haemers, W.H. (2009) Developments on spectral characterizations of graphs. Discrete Math. 309: pp. 576-586 CrossRef
- Cameron, P.J., Goethals, J.-M., Seidel, J.J. (1978) Strongly regular graphs having strongly regular subconstituents. J. Algebra 55: pp. 257-280 CrossRef
- Haemers, W.H. (1995) Interlacing eigenvalues and graphs. Linear Algebra Appl. 226–228: pp. 593-616 CrossRef
- Weetman, G. (1994) Diameter bounds for graph extensions. J. Lond. Math. Soc. 50: pp. 209-221
- The graph with spectrum 141 240 (−4)10 (−6)9
- Open Access
- Available under Open Access This content is freely available online to anyone, anywhere at any time.
Designs, Codes and Cryptography
Volume 65, Issue 1-2 , pp 71-75
- Cover Date
- Print ISSN
- Online ISSN
- Springer US
- Additional Links
- Graph spectrum
- Strongly regular graph
- Root lattice
- Industry Sectors