Symplectic Graphs and Their Automorphisms
Combinatorics
2007-05-23 v1 Group Theory
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.
Cite
@article{arxiv.math/0411452,
title = {Symplectic Graphs and Their Automorphisms},
author = {Zhongming Tang and Zhe-xian Wan},
journal= {arXiv preprint arXiv:math/0411452},
year = {2007}
}
Comments
12 pages