A New Family of Algebraically Defined Graphs With Small Automorphism Group

Abstract

Let p be an odd prime, q = p e , e ≥ 1, and F = F q denote the finite field of q elements. Let f : F 2 → F and g : F 3 → F be functions, and let P and L be two copies of the 3-dimensional vector space F 3 . Consider a bipartite graph Γ F (f, g) with vertex partitions P and L and with edges defined as follows: for everyThe following question appeared in Nassau [9]: Given Γ F (f, g), is it always possible to find a function h : F 2 → F such that the graph Γ F (f, h) with the same vertex set as Γ F (f, g) and with edges (p)[l] defined in a similar way by the system p 2 + l 2 = f (p 1 , l 1 ) and p 3 + l 3 = h(p 1 , l 1 ), is isomorphic to Γ F (f, g) for infinitely many q? In this paper we show that the answer to the question is negative and the graphs Γ Fp (p 1 ℓ 1 , p 1 ℓ 1 p 2 (p 1 + p 2 + p 1 p 2 )) provide such an example for p ≡ 1 (mod 3). Our argument is based on proving that the automorphism group of these graphs has order p, which is the smallest possible order of the automorphism group of graphs of the form Γ F (f, g).