On triple systems and strongly regular graphs
From MaRDI portal
Publication:439052
DOI10.1016/j.jcta.2012.03.013zbMath1245.05009OpenAlexW1982890265MaRDI QIDQ439052
Publication date: 1 August 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2012.03.013
Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07)
Related Items
Switching for 2-designs, Switching for Small Strongly Regular Graphs, Switching in one-factorisations of complete graphs, Enumeration of Steiner triple systems with subsystems, Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group, Construction of strongly regular graphs having an automorphism group of composite order
Uses Software
Cites Work
- Constructing cospectral graphs
- Strongly regular graphs with non-trivial automorphisms
- Switching codes and designs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- Cycle switches in Latin squares
- Classification algorithms for codes and designs
- Strongly regular graphs with smallest eigenvalue -m
- Regular two-graphs on 36 vertices
- Seidel-equivalence in LB\(_3\)(6) graphs
- Strongly regular graphs, partial geometries and partially balanced designs
- Finite nets. II: Uniqueness and imbedding
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
- The Steiner triple systems of order 19
- Nonisomorphic Solutions of pseudo‐(3.5,2) and pseudo‐(3,6,3) graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
