Enumeration of Seidel matrices

Abstract In this paper Seidel matrices are studied, and their spectrum and several related algebraic properties are determined for order n ≤ 13 . Based on this Seidel matrices with exactly three distinct eigenvalues of order n ≤ 23 are classified. One consequence of the computational results is that the maximum number of equiangular lines in R 12 with common angle 1 ∕ 5 is exactly 20 .

[1]  Andries E. Brouwer,et al.  Cospectral Graphs on 12 Vertices , 2009, Electron. J. Comb..

[2]  Tadeusz Sozanski Enumeration of weak isomorphism classes of signed graphs , 1980, J. Graph Theory.

[3]  Willem H. Haemers,et al.  Enumeration of cospectral graphs , 2004, Eur. J. Comb..

[4]  Shui-Hung Hou,et al.  Classroom Note: A Simple Proof of the Leverrier-Faddeev Characteristic Polynomial Algorithm , 1998, SIAM Rev..

[5]  Wei-Hsuan Yu,et al.  A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4 , 2016, Eur. J. Comb..

[6]  Ebrahim Ghorbani,et al.  On eigenvalues of Seidel matrices and Haemers’ conjecture , 2013, Des. Codes Cryptogr..

[7]  Kris Coolsaet,et al.  Classification of some strongly regular subgraphs of the McLaughlin graph , 2008, Discret. Math..

[8]  Willem H. Haemers Seidel Switching and Graph Energy , 2012 .

[9]  Arnold Neumaier,et al.  Graph representations, two-distance sets, and equiangular lines , 1989 .

[10]  Brendan D. McKay,et al.  Generation of Cubic graphs , 2011, Discret. Math. Theor. Comput. Sci..

[11]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[12]  Chris D. Godsil,et al.  Constructing graphs with pairs of pseudo-similar vertices , 1982, J. Comb. Theory, Ser. B.

[13]  J. J. Seidel,et al.  Equilateral point sets in elliptic geometry , 1966 .

[14]  J. Seidel Graphs and two-graphs , 1974 .

[15]  Akihiro Munemasa,et al.  The nonexistence of certain tight spherical designs , 2005 .

[16]  Aidan Roy,et al.  Equiangular lines, mutually unbiased bases, and spin models , 2009, Eur. J. Comb..

[17]  Dominique de Caen,et al.  Large Equiangular Sets of Lines in Euclidean Space , 2000, Electron. J. Comb..

[18]  Peter J. Cameron,et al.  Cohomological aspects of two-graphs , 1977 .

[19]  D. E. Taylor Regular 2‐Graphs , 1977 .

[20]  Dustin G. Mixon,et al.  Steiner equiangular tight frames , 2010, 1009.5730.

[21]  Brendan D. McKay,et al.  Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[22]  J. J. Seidel,et al.  Tables of two-graphs , 1981 .

[23]  Brendan D. McKay,et al.  Hadamard equivalence via graph isomorphism , 1979, Discret. Math..

[24]  Boris Bukh,et al.  Bounds on Equiangular Lines and on Related Spherical Codes , 2015, SIAM J. Discret. Math..

[25]  Akihiro Munemasa,et al.  Equiangular lines in Euclidean spaces , 2014, J. Comb. Theory, Ser. A.

[26]  Tilen Marc,et al.  There is no (95, 40, 12, 20) strongly regular graph , 2016, Journal of Combinatorial Designs.

[27]  W. Haemers Interlacing eigenvalues and graphs , 1995 .

[28]  Peter Keevash,et al.  Equiangular lines and spherical codes in Euclidean space , 2017, Inventiones mathematicae.

[29]  Gary R. W. Greaves Equiangular line systems and switching classes containing regular graphs , 2016, 1612.03644.

[30]  Mikhail E. Muzychuk,et al.  On graphs with three eigenvalues , 1998, Discret. Math..

[31]  A. A. Makhnev On the Nonexistence of Strongly Regular Graphs with Parameters (486, 165, 36, 66) , 2002 .

[32]  N. J. A. Sloane,et al.  TWO-GRAPHS, SWITCHING CLASSES AND EULER GRAPHS ARE EQUAL IN NUMBER* , 1975 .

[33]  Alexander Barg,et al.  New bounds for equiangular lines , 2013, Discrete Geometry and Algebraic Combinatorics.

[34]  Janet C. Tremain Concrete Constructions of Real Equiangular Line Sets , 2008 .

[35]  Edwin R. van Dam,et al.  Nonregular Graphs with Three Eigenvalues , 1998, J. Comb. Theory B.

[36]  Edward Spence,et al.  Small regular graphs with four eigenvalues , 1998, Discret. Math..

[37]  Brendan D. McKay,et al.  Classification of regular two-graphs on 36 and 38 vertices , 2001, Australas. J Comb..