There is no (75,32,10,16) strongly regular graph

DOI10.1016/j.laa.2018.07.019zbMath1396.05122arXiv1509.05933OpenAlexW2963372144MaRDI QIDQ1790457

Tilen Marc, Jernej Azarija

Publication date: 2 October 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05933

zbMATH Keywords

strongly regular graphseigenvaluesinterlacingstar complement technique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Equiangular lines in Euclidean spaces: Dimensions 17 and 18, Equiangular tight frames that contain regular simplices, Saturated configuration and new large construction of equiangular lines, Equiangular line systems and switching classes containing regular graphs, New Bounds for Equiangular Lines and Spherical Two-Distance Sets, Equiangular tight frames from group divisible designs, Real equiangular lines in dimension 18 and the Jacobi identity for complementary subgraphs, Equiangular tight frames with centroidal symmetry, Hermitian matrices of roots of unity and their characteristic polynomials, Equiangular lines and the Lemmens-Seidel conjecture, Packings in Real Projective Spaces, Equiangular lines in low dimensional Euclidean spaces, Frames over finite fields: equiangular lines in orthogonal geometry, Polyphase equiangular tight frames and abelian generalized quadrangles

Uses Software

• nauty
• SageMath
• Cliquer
• Traces
• MaxCliqueDyn
• bliss
• GNU parallel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly regular graphs with non-trivial automorphisms
• Spreads in strongly regular graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• Star complements in regular graphs: old and new results
• A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
• Interlacing eigenvalues and graphs
• Practical graph isomorphism. II.
• An example of using star complements in classifying strongly regular graphs
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs