Symplectic Graphs and Their Automorphisms

Zhe-Xian Wan*
¹Chinese Academy of Science
²Center for Combinatorics, Nankai University, P.R. China

Abstract    Full Text PDF

Let be a finite field of any characteristic, an integer,

and
Let , denote the 1-dim subspace spanned by α by . The symplectic graph of K over , denoted by , with the set of 1-dim subspaces of as its vertex set and with the adjacency defined by: where means that and are adjacent. It is shown that is strongly regular, its parameters are computed and its chromatic number and group of automorphisms are determined.

---

* This is joint work with Zhongming Tang.