×

Symplectic graphs and their automorphisms. (English) Zbl 1078.05092

Summary: A new family of strongly regular graphs, called the general symplectic graphs \(Sp(2v,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.

MSC:

05E30 Association schemes, strongly regular graphs
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
05C15 Coloring of graphs and hypergraphs

References:

[1] Dye, R. H., Partitions and their stabilizers for line complexes and quadrics, Ann. Mat. Pura Appl., 114, 173-194 (1977) · Zbl 0369.50012
[2] Godsil, C.; Royle, G., Chromatic number and the 2-rank of a graph, J. Combin. Theory Ser. B, 81, 142-149 (2001) · Zbl 1026.05046
[3] Godsil, C.; Royle, G., Algebraic Graph Theory, Graduate Texts in Mathematics, vol. 207 (2001), Springer-Verlag · Zbl 0968.05002
[4] Rotman, J. J., Projective planes, graphs, and simple algebras, J. Algebra, 155, 267-289 (1993) · Zbl 0771.05049
[5] Rotman, J. J.; Weichsel, P. M., Simple Lie algebras and graphs, J. Algebra, 169, 775-790 (1994) · Zbl 0823.17008
[6] Wan, Z., Geometry of Classical Groups over Finite Fields (2002), Science Press: Science Press Beijing, New York
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.