Abstract
1. Introduction. Let G be a rank 3 permutation group of even order on a finite set X, |X| = n, and let Δ and Γ be the two nontrivial orbits of G in X×X under componentwise action. As pointed out by Sims [6], results in [2] can be interpreted as implying that the graph = (X, Δ) is a strongly regular graph, the graph theoretical interpretation of the parameters k, l, λ and μ of [2] being as follows: k is the degree of , λ is the number of triangles containing a given edge, and μ is the number of paths of length 2 joining a given vertex P to each of the l vertices ≠ P which are not adjacent to P. The group G acts as an automorphism group on and on its complement = (X,Γ).
Sign-in/Register to access full text options 
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.
