Symplectic inner product graphs and their automorphisms
Hengbin Zhang, Shouxiang Zhao, Jizhu Nan, Gaohua Tang

TL;DR
This paper introduces the symplectic inner product graph over finite fields, analyzes its connectivity and diameter, and determines its automorphism group, providing conditions for vertex and edge orbits under automorphisms.
Contribution
It defines the new symplectic inner product graph and characterizes its automorphism group and orbit conditions, advancing understanding of its symmetry properties.
Findings
The graph is connected with diameter 4 for ν ≥ 2.
Automorphism group of the graph is explicitly determined.
Necessary and sufficient conditions for orbit equivalences are established.
Abstract
A new graph, called the symplectic inner product graph , over a finite field is introduced. We show that is connected with diameter if and only if and the automorphism group of is determined. Two necessary and sufficient conditions for two vertices of and two edges of respectively are in the same orbit under the action of the automorphism group of are obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Cooperative Communication and Network Coding
