paper

A New Family of Algebraically Defined Graphs With Small Automorphism Group

arXiv:2109.03130

Abstract

Let be an odd prime, , , and denote the finite field of elements. Let and be functions, and let and be two copies of the 3-dimensional vector space . Consider a bipartite graph with vertex partitions and and with edges defined as follows: for every and every , is an edge in if Given , is it always possible to find a function such that the graph with the same vertex set as and with edges defined in a similar way by the system is isomorphic to for infinitely many ? In this paper we show that the answer to the question is negative and the graphs provide such an example for . Our argument is based on proving that the automorphism group of these graphs has order , which is the smallest possible order of the automorphism group of graphs of the form .

25 pages