On triple systems and strongly regular graphs
From MaRDI portal
(Redirected from Publication:439052)
Recommendations
Cites work
- scientific article; zbMATH DE number 5130692 (Why is no real title available?)
- scientific article; zbMATH DE number 3981181 (Why is no real title available?)
- scientific article; zbMATH DE number 3674125 (Why is no real title available?)
- scientific article; zbMATH DE number 3685526 (Why is no real title available?)
- scientific article; zbMATH DE number 3756498 (Why is no real title available?)
- scientific article; zbMATH DE number 3482386 (Why is no real title available?)
- scientific article; zbMATH DE number 1256777 (Why is no real title available?)
- scientific article; zbMATH DE number 3445296 (Why is no real title available?)
- scientific article; zbMATH DE number 1404121 (Why is no real title available?)
- scientific article; zbMATH DE number 3432307 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- scientific article; zbMATH DE number 3380658 (Why is no real title available?)
- Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
- Classification algorithms for codes and designs
- Classification of regular two-graphs on 36 and 38 vertices
- Constructing cospectral graphs
- Cycle switches in Latin squares
- Finite nets. II: Uniqueness and imbedding
- Nonisomorphic Solutions of pseudo‐(3.5,2) and pseudo‐(3,6,3) graphs
- Regular two-graphs on 36 vertices
- Seidel-equivalence in LB\(_3\)(6) graphs
- Strongly regular graphs with non-trivial automorphisms
- Strongly regular graphs with smallest eigenvalue -m
- Strongly regular graphs, partial geometries and partially balanced designs
- Switching codes and designs
- The CRC handbook of combinatorial designs
- The Steiner triple systems of order 19
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- The cycle switching graph of the Steiner triple systems of order 19 is connected
Cited in
(12)- The cycle switching graph of the Steiner triple systems of order 19 is connected
- Strongly regular graphs and designs with three intersection numbers
- scientific article; zbMATH DE number 26308 (Why is no real title available?)
- Regular \(t\)-bonded systems in \(\mathbb{R}^3\)
- Switching for small strongly regular graphs
- Enumeration of Steiner triple systems with subsystems
- Strongly regular tri-Cayley graphs
- Construction of strongly regular graphs having an automorphism group of composite order
- Switching in one-factorisations of complete graphs
- Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
- Strong triadic closure in cographs and graphs of low maximum degree
- Switching for 2-designs
This page was built for publication: On triple systems and strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439052)
