The regular two-graph on 276 vertices
From MaRDI portal
Publication:1219301
DOI10.1016/0012-365X(75)90029-1zbMath0311.05121OpenAlexW1969891477MaRDI QIDQ1219301
J. J. Seidel, Jean-Marie Goethals
Publication date: 1975
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(75)90029-1
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items
On the number of nodes in \(n\)-dimensional cubature formulae of degree 5 for integrals over the ball, Implementing Brouwer's database of strongly regular graphs, Symmetric association schemes of class 2, Some relations between roots, holes, and pillars, Johan Jacob Seidel, Strongly regular graphs with strongly regular decomposition, The nonexistence of certain tight spherical designs, Characterization theorems for Zara graphs, Diagrams for geometries and groups, There is no McLaughlin geometry, Binary codes of some strongly regular subgraphs of the McLaughlin graph, Remark on the generalized graph extension theorem, Strongly regular graphs having strongly regular subconstituents, On strongly regular designs admitting fusion to strongly regular decomposition, Segre's hemisystem and McLaughlin's graph, Completely regular twographs, Which graphs are determined by their spectrum?, Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields, A classification of flag-transitive classical \(c.C_ 2\)-geometries by means of generators and relations, Spreads in strongly regular graphs, Classification of some strongly regular subgraphs of the McLaughlin graph, On the \(p\)-rank of the adjacency matrices of strongly regular graphs, Ball packings with high chromatic numbers from strongly regular graphs, Frames, graphs and erasures, Is there a McLaughlin geometry?, Locally polar spaces and related rank 3 groups, Two-graphs and NSSDs: an algebraic approach, Equiangular lines and the Lemmens-Seidel conjecture, Open problems in the spectral theory of signed graphs, On graphs with smallest eigenvalue at least \(-3\) and their lattices, On the integrability of strongly regular graphs, Sets of complex unit vectors with few inner products and distance-regular graphs, A design and a code invariant under the simple group \(Co_ 3\), Maximality of Seidel matrices and switching roots of graphs, Universally optimal distribution of points on spheres, L-polytopes and equiangular lines, Discrete hyperbolic geometry, The Hermitian two-graph and its code
Cites Work
- Unrestricted codes with the Golay parameters are unique
- Reflection subgroups of finite complex reflection groups.
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Characterization of families of rank 3 permutation groups by the subdegrees. II
- Weights of linear codes and strongly regular normed spaces
- Equiangular lines
- On the uniqueness of the Golay codes
- Strongly Regular Graphs Derived from Combinatorial Designs
- SYMMETRIC HADAMARD MATRICES OF ORDER 36
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item