A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
From MaRDI portal
Publication:1024293
DOI10.1016/j.ejc.2008.07.021zbMath1207.05225OpenAlexW2069892593MaRDI QIDQ1024293
Marko Milošević, Dragan Stevanović
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.021
Association schemes, strongly regular graphs (05E30) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (7)
Equitable partition and star set formulas for the subgraph centrality of graphs ⋮ A note on the multiplicities of graph eigenvalues ⋮ On a family of strongly regular graphs with \(\lambda = 1\) ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Star complements in regular graphs: old and new results ⋮ There is no (75,32,10,16) strongly regular graph ⋮ On the multiplicity of eigenvalues of trees
Cites Work
This page was built for publication: A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)