Enumeration of Seidel matrices

DOI10.1016/j.ejc.2017.10.009zbMath1376.05026arXiv1703.02943OpenAlexW2593771528MaRDI QIDQ1686262

Ferenc Szöllősi, Patric R. J. Östergård

Publication date: 21 December 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

generation of Seidel matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

The change of Seidel energy of tripartite Turán graph due to edge deletion ⋮ Seidel spectrum of threshold graphs ⋮ On the spectrum of some signed complete and complete bipartite graphs ⋮ Equiangular line systems and switching classes containing regular graphs ⋮ The Seidel spectrum of two variants of join operations ⋮ Hermitian matrices of roots of unity and their characteristic polynomials ⋮ On the Sα-matrix of graphs ⋮ Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs ⋮ Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum ⋮ Equiangular frames and generalizations of the Welch bound to dual pairs of frames ⋮ A remark on a construction of D. S. Asche ⋮ Open problems in the spectral theory of signed graphs ⋮ On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix ⋮ Globally Optimizing Small Codes in Real Projective Spaces ⋮ Spectral Proofs of Maximality of Some Seidel Matrices ⋮ Equiangular Frames and Their Duals

Uses Software

• nauty
• Traces
• snarkhunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner equiangular tight frames
• Classification algorithms for codes and designs
• Equiangular lines in Euclidean spaces
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• Constructing graphs with pairs of pseudo-similar vertices
• Cohomological aspects of two-graphs
• Hadamard equivalence via graph isomorphism
• Nonregular graphs with three eigenvalues
• Enumeration of cospectral graphs.
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• Large equiangular sets of lines in euclidean space
• Interlacing eigenvalues and graphs
• Graph representations, two-distance sets, and equiangular lines
• On eigenvalues of Seidel matrices and Haemers' conjecture
• Cospectral graphs on 12 vertices
• Equiangular line systems and switching classes containing regular graphs
• Practical graph isomorphism. II.
• Classification of some strongly regular subgraphs of the McLaughlin graph
• Equiangular lines, mutually unbiased bases, and spin models
• Equiangular lines
• Bounds on Equiangular Lines and on Related Spherical Codes
• New bounds for equiangular lines
• Enumeration of weak isomorphism classes of signed graphs
• Regular 2-Graphs
• Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm
• Isomorph-Free Exhaustive Generation
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• The nonexistence of certain tight spherical designs
• The Generation of Fullerenes

This page was built for publication: Enumeration of Seidel matrices