Symplectic Graphs and Their Automorphisms
Abstract
A new family of strongly regular graphs, called the general symplectic graphs Sp(2, 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.