On triple systems and strongly regular graphs

DOI10.1016/J.JCTA.2012.03.013zbMATH Open1245.05009OpenAlexW1982890265MaRDI QIDQ439052FDOQ439052

Authors: Majid Behbahani, Clement Lam, Patric R. J. Östergård 

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

Recommendations

• Switching for small strongly regular graphs
• scientific article; zbMATH DE number 3889571
• Publication:4937802
• scientific article; zbMATH DE number 26308
• scientific article; zbMATH DE number 2164132

zbMATH Keywords

strongly regular graphLatin squareswitchingSteiner triple system

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07)

Cites Work

• The CRC handbook of combinatorial designs
• Constructing cospectral graphs
• Classification algorithms for codes and designs
• Strongly regular graphs with smallest eigenvalue -m
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classification of regular two-graphs on 36 and 38 vertices
• 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
• Finite nets. II: Uniqueness and imbedding
• Title not available (Why is that?)
• Cycle switches in Latin squares
• Title not available (Why is that?)
• Regular two-graphs on 36 vertices
• Seidel-equivalence in LB\(_3\)(6) graphs
• Strongly regular graphs, partial geometries and partially balanced designs
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
• Title not available (Why is that?)
• The Steiner triple systems of order 19
• Title not available (Why is that?)
• Nonisomorphic Solutions of pseudo‐(3.5,2) and pseudo‐(3,6,3) graphs
• Title not available (Why is that?)

Cited In (12)

• The cycle switching graph of the Steiner triple systems of order 19 is connected
• Construction of strongly regular graphs having an automorphism group of composite order
• Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
• Switching for 2-designs
• Switching in one-factorisations of complete graphs
• Strong triadic closure in cographs and graphs of low maximum degree
• Enumeration of Steiner triple systems with subsystems
• Switching for small strongly regular graphs
• Strongly regular graphs and designs with three intersection numbers
• Strongly regular tri-Cayley graphs
• Regular \(t\)-bonded systems in \(\mathbb{R}^3\)
• Title not available (Why is that?)

Uses Software

• Cliquer

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)