Abstract
Let Γ be a strongly regular graph with parameters (v, k, 1, 2). Then k = u2 + u + 2 and u = 1, 3, 4, 10, or 31. It is known that such graphs exist for u equal to 1 and 4. They are the (3 × 3)-lattice and the graph of cosets of the ternary Golay code. If u = 3, then Γ has the parameters (99, 14, 1, 2). The question on existence of such graphs was posed by J. Seidel.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
