Abstract
Meemark and Prinyasart [10] proved by combinatorial method that the symplectic graph Sppn(2ν) modulo pn is strongly regular when ν=1, and Sppn(2ν) is arc transitive when p is an odd prime. In this paper, combining matrix method and elementary number theory, we continue this research, and prove that Sppn(2ν) is arc transitive for any prime p. Furthermore, we determine the suborbits of the symplectic group modulo pn on Sppn(2ν), and show that Sppn(2ν) is a strictly Deza graph when ν≥2 and n≥2.
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.
