Symplectic graphs and their automorphisms

The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphisms are also determined.

• Type: Journal
• Year: 2006
• Where: EJC
• Authors: Zhongming Tang, Zhe-xian Wan
• Keywords: Chromatic Number, EJC 2006, EJC 2007, General Symplectic Graph, Graph Automorphisms