Symplectic Graphs and Their Automorphisms
classification
🧮 math.CO
math.GR
keywords
graphsautomorphismsregularstronglysymplecticalternateassociatedcalled
read the original abstract
A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their groups of graph automorphisms are determined.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.