A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
DOI10.1016/J.EJC.2008.07.021zbMATH Open1207.05225OpenAlexW2069892593MaRDI QIDQ1024293FDOQ1024293
Authors: Dragan Stevanović, Marko Milošević 
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
Recommendations
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- On the strongly regular graph with parameters (64, 18, 2, 6)
- scientific article; zbMATH DE number 1778119
- Uniqueness of strongly regular graphs having minimal \(p\)-rank
- scientific article; zbMATH DE number 1961271
- The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
- Some spectral characterizations of strongly distance-regular graphs
- The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
- On strongly regular graphs with \(b_{1} < 26\)
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)
Cites Work
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- Eigenspaces of graphs
- Title not available (Why is that?)
- Strongly regular graphs having strongly regular subconstituents
- Co-cliques and star complements in extremal strongly regular graphs
- Title not available (Why is that?)
- Some characterizations of graphs by star complements
Cited In (12)
- On the multiplicity of eigenvalues of trees
- Comparison of two techniques for proving nonexistence of strongly regular graphs
- Title not available (Why is that?)
- A computer-assisted proof of the uniqueness of the Perkel graph
- There is no (75,32,10,16) strongly regular graph
- On the uniqueness of some girth eight algebraically defined graphs. II
- Equitable partition and star set formulas for the subgraph centrality of graphs
- On a family of strongly regular graphs with \(\lambda = 1\)
- Graphs with least eigenvalue \(-2\): ten years on
- The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
- A note on the multiplicities of graph eigenvalues
- Star complements in regular graphs: old and new results
This page was built for publication: A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024293)
