The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition

zbMATH Open1100.05102MaRDI QIDQ5488384FDOQ5488384

Authors: Mariusz Meszka, Sven Reichard, Mikhail H. Klin, Alexander Rosa 

Publication date: 14 September 2006

Recommendations

• Two families of strongly regular graphs with the 4-vertex condition
• The strongly regular (45,\,12,\,3,\,3) graphs
• Non rank 3 strongly regular graphs with the 5-vertex condition
• Strongly regular graphs with the \(7\)-vertex condition
• On highly regular strongly regular graphs

zbMATH Keywords

Steiner triple systemtwo-graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Triple systems (05B07)

Cited In (9)

• Some implications on amorphic association schemes
• On a family of highly regular graphs by Brouwer, Ivanov, and Klin
• Strongly regular graphs with the \(7\)-vertex condition
• Title not available (Why is that?)
• On highly regular strongly regular graphs
• Non rank 3 strongly regular graphs with the 5-vertex condition
• Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
• Classification of highly symmetrical translation loops of order \(2p\), \(p\) prime.
• Steiner triple systems satisfying the 4-vertex condition

This page was built for publication: The smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex condition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488384)