The graph with spectrum 14¹ 2⁴⁰( - 4)^10( - 6)^9
DOI10.1007/S10623-011-9529-6zbMATH Open1245.05085OpenAlexW2164371233MaRDI QIDQ438892FDOQ438892
Aart Blokhuis, Willem H. Haemers, Andries E. Brouwer
Publication date: 31 July 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9529-6
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Association schemes, strongly regular graphs (05E30)
Cites Work
- Title not available (Why is that?)
- Developments on spectral characterizations of graphs
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- Which graphs are determined by their spectrum?
- Interlacing eigenvalues and graphs
- Strongly regular graphs having strongly regular subconstituents
- Diameter Bounds for Graph Extensions
This page was built for publication: The graph with spectrum \(14^{1} 2^{40}( - 4)^{10}( - 6)^{9}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438892)
