Symplectic Graphs and Their Automorphisms
arXiv:math/0411452
Abstract
A new family of strongly regular graphs, called the general symplectic graphs , 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.
12 pages