Enumeration of Seidel matrices
From MaRDI portal
Eigenvalues, singular values, and eigenvectors (15A18) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Abstract: In this paper Seidel matrices are studied, and their spectrum and several related algebraic properties are determined for order . Based on this Seidel matrices with exactly three distinct eigenvalues of order are classified. One consequence of the computational results is that the maximum number of equiangular lines in with common angle is exactly .
Recommendations
- Maximality of Seidel matrices and switching roots of graphs
- On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix
- Equiangular lines in Euclidean spaces
- Equiangular line systems and switching classes containing regular graphs
- Spectral proofs of maximality of some Seidel matrices
Cites work
- scientific article; zbMATH DE number 3756498 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 3482386 (Why is no real title available?)
- scientific article; zbMATH DE number 1961271 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3308127 (Why is no real title available?)
- scientific article; zbMATH DE number 3341061 (Why is no real title available?)
- scientific article; zbMATH DE number 3056554 (Why is no real title available?)
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- Bounds on equiangular lines and on related spherical codes
- Classification algorithms for codes and designs
- Classification of regular two-graphs on 36 and 38 vertices
- Classification of some strongly regular subgraphs of the McLaughlin graph
- Classroom Note:A Simple Proof of the Leverrier--Faddeev Characteristic Polynomial Algorithm
- Cohomological aspects of two-graphs
- Constructing graphs with pairs of pseudo-similar vertices
- Cospectral graphs on 12 vertices
- Enumeration of cospectral graphs.
- Enumeration of weak isomorphism classes of signed graphs
- Equiangular line systems and switching classes containing regular graphs
- Equiangular lines
- Equiangular lines in Euclidean spaces
- Equiangular lines, mutually unbiased bases, and spin models
- Generation of cubic graphs
- Graph representations, two-distance sets, and equiangular lines
- Hadamard equivalence via graph isomorphism
- Interlacing eigenvalues and graphs
- Isomorph-Free Exhaustive Generation
- Large equiangular sets of lines in euclidean space
- New bounds for equiangular lines
- Nonregular graphs with three eigenvalues
- On eigenvalues of Seidel matrices and Haemers' conjecture
- On graphs with three eigenvalues
- Practical graph isomorphism. II.
- Regular 2-Graphs
- Seidel switching and graph energy
- Small regular graphs with four eigenvalues
- Steiner equiangular tight frames
- The nonexistence of certain tight spherical designs
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
Cited in
(21)- Sets of equiangular lines in dimension 18 constructed from A₉ A₉ A₁
- Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
- scientific article; zbMATH DE number 1890080 (Why is no real title available?)
- Spectral proofs of maximality of some Seidel matrices
- Open problems in the spectral theory of signed graphs
- Equiangular Frames and Their Duals
- On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix
- Seidel spectrum of threshold graphs
- Equiangular frames and generalizations of the Welch bound to dual pairs of frames
- Globally optimizing small codes in real projective spaces
- On the spectrum of some signed complete and complete bipartite graphs
- Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum
- Maximality of Seidel matrices and switching roots of graphs
- Hermitian matrices of roots of unity and their characteristic polynomials
- An algorithm to calculate generalized Seifert matrices
- The change of Seidel energy of tripartite Turán graph due to edge deletion
- The Seidel spectrum of two variants of join operations
- A remark on a construction of D. S. Asche
- Equiangular line systems and switching classes containing regular graphs
- Enumeration of sets of equiangular lines with common angle ((1 / 3))
- On the Sα-matrix of graphs
This page was built for publication: Enumeration of Seidel matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686262)