A New Family of Algebraically Defined Graphs With Small Automorphism Group

Abstract

Let p be an odd prime, q=pe, e 1, and F = Fq denote the finite field of q elements. Let f: F2 F and g: F3 F be functions, and let P and L be two copies of the 3-dimensional vector space F3. Consider a bipartite graph F (f, g) with vertex partitions P and L and with edges defined as follows: for every (p)=(p1,p2,p3)∈ P and every [l]= [l1,l2,l3]∈ L, \(p), [l]\ = (p)[l] is an edge in F (f, g) if p2+l2 =f(p1,l1) \;\;\;and\;\;\; p3 + l3 = g(p1,p2,l1). Given F (f, g), is it always possible to find a function h:F2 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 p2+l2 =f(p1,l1) \;\;\;and\;\;\; p3 + l3 = h(p1,l1), 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(p11, p11p2(p1 + p2 + p1p2)) provide such an example for p 1 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).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…