Symplectic inner product graphs and their automorphisms
Combinatorics
2022-09-27 v2
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.
Cite
@article{arxiv.2205.09426,
title = {Symplectic inner product graphs and their automorphisms},
author = {Hengbin Zhang and Shouxiang Zhao and Jizhu Nan and Gaohua Tang},
journal= {arXiv preprint arXiv:2205.09426},
year = {2022}
}