299
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Automorphism groups of the constituent graphs of integral distance graphs

&
Pages 308-312 | Received 28 Sep 2021, Accepted 01 Aug 2023, Published online: 24 Aug 2023

Abstract

In this paper, we consider the automorphism groups of Cayley graphs which are a basis of a complete Boolean algebra of strongly regular graphs, one of such graph is the integral distance graph Γ. The automorphism groups of the integral distance graphs Γ were determined by Kovács and Ruff in 2014 and by Kurz in 2009. Our point of interest will be restricted to the one determined by Kovács and Ruff. Here we consider the automorphism groups of subgraphs Γ1 and Γ2, which inherit the properties of Γ. It will be shown that Aut Γ is isomorphic to Aut Γ2 and that Aut Γ1 is isomorphic to SFq2S[2].

1 Introduction

In this paper, all considered graphs are assumed to be finite, simple and connected. A graph Γ=(V,E) is a set V of vertices together with a relation E, which is irreflexive and symmetric. If in Γ=(V,E), the reflexivity and symmetry of the binary relation are not insisted upon, then we speak of a directed graph or digraph. For a graph Γ, we let V(Γ), E(Γ) and {x, y} denote the vertex set, the edge set, and an edge with endpoints x and y in V(Γ), respectively. For an edge {x, y}, x and y are said to be adjacent in Γ. For digraphs, arcs are represented by pairs of the form (u,v). By the complement of Γ is meant a graph ΓC with V(ΓC)=V(Γ) such that {x,y}E(ΓC) if and only if {x,y}E(Γ).

Let Γ and Λ be graphs. By a graph isomorphism between Γ and Λ is meant a bijection σ:V(Γ)V(Λ) such that {xσ,yσ}E(Λ) if and only if {x,y}E(Γ) and if Γ is isomorphic to Λ, it is denoted by ΓΛ. By a self-complementary graph is meant a graph Γ isomorphic to its complement. If σ is a permutation of V(Γ) that preserves adjacency relations, then it is called an automorphism of Γ. By the automorphism group of Γ, denoted by Aut Γ, is meant the set of all automorphisms of Γ. Γ is vertex-transitive if Aut Γ is transitive on V(Γ); i.e., V(Γ) is a single orbit under the action of Aut Γ.

Let G be a group and 1G an identity element of G. Let S be a subset of G such that 1GS and S=S1. By the Cayley graph Γ=Cay(G,S) is meant a graph defined by V(Γ):=G and E(Γ):={{x,xs}:xG,sS}. The set S is called a Cayley set on G. It is a classical result that for Γ=Cay(G,S), the subset G(S{1G}) is a Cayley set on G for the complementary graph ΓC. The mapping defined by xgx,x,gG, is clearly an automorphism of Γ=Cay(G,S). It is immediate therefore that, Γ=Cay(G,S) is vertex-transitive. The following result regarding isomorphism of Cayley graphs is very important and will be used in the last section of the paper.

Proposition 1.

[Citation3, Lemma 3.7.3] Let ϕ be an automorphism of the group G and let S be a Cayley set of G. Then Cay(G,S)Cay(G,Sϕ).

In addition to the pertinent concepts of graphs to be used in this paper, we present some definitions and results related to primitive permutation groups and integral distances over finite fields.

The action of a group G on the set Ω can be extended to subsets Δ of Ω by defining Δx={δx:δΔ} for each ΔΩ and xG. Denote by GΔ the elementwise stabilizer of Δ in G; while G{Δ} denotes the setwise stabilizer of Δ in G. If Δ={δ1,,δk}, then Gδ1,,δk denotes G{δ1,,δk}; in particular, Gδ denotes G{δ}. If in addition, G acts transitively on Ω, a subset ΔΩ is called a block for G if for every xG,Δx=Δ or ΔΔx=. The sets Δx,xG, form a partition of Ω which is called a system of blocks for G containing Δ. If G is transitive on Ω, then it is clear that Ω and the singletons {α} (αΩ) are blocks for G. If the latter are the only blocks for G, then G is said to be primitive. Otherwise, G is called imprimitive.

It has been shown that a transitive permutation group G on Ω can be seen to act as a group of automorphisms of a directed graph. If G is finite, then G acts on Ω×Ω coordinatewise, and the respective orbits are called the orbitals of G. Since G is transitive on Ω, the set {(ω,ω):ωΩ} is an orbital, explicitly called the diagonal orbital of G. Given an orbital Δ of G, the orbital digraph Graph(Δ) is defined to have vertex set Ω and arc set Δ. The number of orbits of the stabilizer Gω is equal to the number of the orbitals of G for any ωΩ. This number is called the rank of G.

The purpose of this paper is to present what we consider as the building blocks of the two-dimensional integral distance graphs G2,q over the finite field Fq, q=pr, p prime and p>2, and discuss their automorphism group. We will consider the action of automorphism groups of integral distance graphs in relation to the automorphisms of their constituent graphs.

In the rest of the paper, before we discuss the main results, we give in Section 2 some details of the automorphism groups of G2,q for q1(mod4) to be used in Section 3.2. We shall look at the automorphism groups of the constituent graphs Γi=Cay(Fq2,Si), i = 1, 2, 3, of G2,q, q1(mod4), with Si, i = 1, 2, the two base subsets of Fq2 to be defined in Section 3, and S3=Fq2(S1S2{0}). In particular, we show that the automorphism group of the one of Γi, i = 1, 2, 3, is isomorphic to the direct product of the group of translations by the elements of Fq2 with the wreath product of the symmetric group S[q1] by S[2] in Section 3.1, and the automorphism groups of the rest of the Γi s, i = 2, 3, are isomorphic to the automorphism group of the original graph G2,q in Section 3.2.

2 Integral automorphism of affine planes over finite fields

Two points in an Euclidean space are said to be at integral distance if their squared Euclidean distance is a perfect square. Integral point sets were defined in m-dimensional Euclidean space Em as a set of points with pairwise integral distances in the Euclidean metric; see [Citation5, Citation6, Citation8–10]. Here we consider such a concept to inner product spaces Fqm over a finite field Fq,q=pr, p prime.

It turns out that it is useful to model integral point sets as cliques of certain graphs. For a given prime power q=pr and a given dimension, a graph of integral distance is a graph Gm,q with vertex set Fqm, where two vertices x and y form an edge in it, if they are at integral distance. In [Citation4], integral distance graphs Gm,q were shown to be Cayley and strongly regular for m0(mod2) as well as their constituent graphs for m = 2 and q1(mod4) that we shall define in Section 3. The automorphism groups of Gm,q, m2, have been described by Kovács et al. [Citation7] and by Kurz et al. [Citation6, Citation9, Citation10]. For q3(mod4), the graph G2,q can be shown to be isomorphic to the Paley graph P(q2) of square order; see [Citation6, Citation7, Citation10]. Our point of interest for symmetries will only focus on the two-dimensional case for q1(mod4). Here, we shall only deal with automorphism groups of the constituent graphs of G2,q.

For the finite field Fq of order q=pr, p prime, q denotes the set of all perfect squares in Fq including the zero element. The norm N:Fq2Fq of a point x=(x1,x2) is defined by N(x)=x12+x22, and two points x,yFq2 are said to be at integral distance if N(xy)q. That is, the norm N(xy) can be interpreted on the squared Euclidean distance between x and y. For a line L=P+Fq·Q with {P,Q}Fq2,Q(0,0),D=Fq·Q is called the direction of L. If N(Q)q, then D is an integral direction. If N(Q)=0, then D is a vanishing direction.

In the finite field Fq, it is shown in [Citation2] that 1q for q1(mod4). However, for q3(mod4),1q so that x2+1 is irreducible. Here, Fq2 can be considered as Fq[i] where i is a root of the polynomial x2+1Fq[x]. In addition, Fq[i] can be identified as Fq2 which is a field, see [Citation6, Citation7, Citation9].

The following parametric representation of pairs of Fq2 is very important. It will be a very useful result in some of the counting arguments in the rest of the paper.

Theorem 1.

[Citation6, Citation10] Let cFq and denote Pc={(a,b,c)Fq3:a2+b2=c2} for c0. Then P0={{(t,±tω,0):tFq}if q1(mod4),{(0,0,0)}if q3(mod4);  and Pc={(±c,0,c)}{(0,±c,c)}{(t21t2+1·c,2tt2+1·c,c):tFq*,t2±1}.

Moreover, |P0|={2q1if q1(mod4),1if q3(mod4); and|Pc|={q1if q1(mod4),q+1if q3(mod4).

For q1(mod4), the points PFq2 can be represented in another basis of Fq2 that yields a simple representation of the norm and the vanishing lines. These points are said to be given in hyperbolic coordinates. In this representation, the coordinates (α,β) in which the norm of P in that new basis is N(P)=αβ with vanishing directions (Fq,0) and (0,Fq). See further details in [Citation6].

As with all combinatorial structures, the question of the automorphisms of integral point sets arises. In this case, there are two natural ways to define an automorphism: By an integral automorphism of the affine plane Fq2 is meant a permutation σ of Fq2 which preserves the integral distances; i.e., for all x,yFq2, N(xy)qN(xσyσ)q.

If additionally the permutation σ is an element of the affine semi-linear group AΓL2(Fq), then σ is called an affine integral automorphism.

The group of all integral automorphisms and those of all affine integral automorphisms are denoted by Aut(Fq2) and AffAut(Fq2), respectively. Aut(Fq2) is exactly the automorphism group of the graph of integral distances G2,q. It is clear that AffAut(Fq2) is a subgroup of Aut(Fq2) [Citation6]. Now the following are the characterizations of the affine integral automorphisms of Fq2.

Theorem 2.

[Citation6, Citation9] Let q{5,9}. Then AffAut(Fq2) is generated by

  1. the translations λu:xx+u for all uFq2;

  2. the reflexion R:(x1,x2)(x2,x1);

  3. the spiral collineations M:(x1,x2)(x1,x2)(abba) for a,bFq with a2+b2q*; and,

  4. The Frobenius automorphisms σ:(x1,x2)(x1p,x2p), with p the characteristic of Fq.

In [Citation9], it has been shown that no other permutation of Fq2 than those mentioned above is an affine integral automorphism of Fq2. Now in Theorem 2, with counting arguments, the orders of R, σ and λu, uFq2, are 2, r and q2, respectively. With the same argument, since q*=q{0} is a subgroup of Fq*,a multiplicative cyclic group, we have that |q*|=q12. Hence, with the help of Theorem 1 for the order of M, it follows that |AffAut(Fq2)|={q2(q1)2rif q1(mod4);q{5,9};q2(q+1)(q1)rif q3(mod4).

The details of automorphism groups of G2,q for q3(mod4) were given in [Citation9]. In either that case or q5, q prime, it has been shown in [6, Theorem 9] that AffAut(Fq2)=Aut(Fq2). In the remaining case; namely, q1(mod4), q=pr and r2, the map ψ:(α,β)(α,βp) was shown to be an integral automorphism of Fq2, but not an affine automorphism, so that AffAut(Fq2) and Aut(Fq2) are not isomorphic, see [6, Theorem 13]. In the latter case with q9, it was conjectured in [Citation6] that Aut(Fq2)=AffAut(Fq2),ψ. Hence this lead to the following.

Theorem 3.

[7, Theorem 1] Let q=pr, where p is a prime and q1(mod4),q{5,9}. Then |Aut(Fq2)|=(q(q1)r)2.

3 Automorphism groups of the constituent graphs of G2,q, q1(mod4)

By [4, Proposition 3.10], it is shown that G2,q is a Cayley graph Cay(Fq2,S) where S={xFq2:x(0,0),N(x)q} is the connecting set of the integral distance graph.

For q1(mod4), there exists ωFq such that ω2=1. The linear mapping ϕ:(x1,x2)(x1+ωx2,x1ωx2) defined in [Citation7] maps the graph Cay(Fq2,S) to Cay(Fq2,Sϕ) where Sϕ={xFq2:x(x1,x2)0,x1x2q}; i.e., ϕ is a switch to hyperbolic coordinates, see [Citation7].

We set S:=Sϕ and Γ:=Cay(Fq2,S). Here we consider the two base subsets S1 and S2 of Fq2 defined by (1) S1={(x1,x2)Fq2{(0,0)}:x1x2=0}=(Fq*,0)(0,Fq*);(1) and (2) S2={(x1,x2)Fq2:x1x2q*}.(2)

Clearly, S=S1S2. It is easy to show that Si, i = 1, 2, are Cayley sets in the addition group Fq2 so that we have the Cayley graphs Γi=Cay(Fq2,Si) by [4, Lemma 3.2, Corollary 3.3]. It is also shown in [Citation4, Citation11] that the subsets Si, i = 1, 2, of Fq2 form a basis of Boolean algebra B=S1,S2 of Cayley sets so that Γ=Cay(Fq2,S) is a Cayley graph by [4, Corollary 3.3]. In addition, we shall consider another subset (3) S3=Fq2(S1S2{0})(3) so that we have another Cayley graph Γ3=Cay(Fq2,S3) by [4, Corollary 3.3]. The three graphs Γi=Cay(Fq2,Si), i = 1, 2, 3, are called in this paper the constituent graphs of the integral distance graphs over Fq2,q1(mod4).

As a starting point, the following permutations of Fq2 have already been defined in [Citation7]. λ(a,b):(x1,x2)(x1+a,x1+b),a,bFq, R:(x1,x2)(x2,x1), Ma+:(x1,x2)(ax1,ax2),aFq*, Ma:(x1,x2)(ax1,a1x2), aFq*, A1:(x1,x2)(x1p,x2), and A2:(x1,x2)(x1,x2p).

Let F be the group generated by the permutations of Fq2 defined above. We shall show that F is a subgroup of Aut Γi, where Γi=Cay(Fq2,Si), i = 1, 2, 3, with S1 and S2 the base subsets of Fq2 defined above; and S3 the complement of S{0} in Fq2,S=S1S2.

In addition, it is easy to show that F is also generated by the conjugates of the elements of AffAut(Fq2) from Theorem 2 by the Fq -linear mapping ϕ:(x1,x2)(x1+ωx2,x1ωx2), ω2=1, together with the mapping ψ defined in Section 2.

Moreover, it is shown that F in its action on V(Γi), i = 1, 2, 3, is primitive, see Lemma 2. That is, Aut Γi, i = 1, 2, 3, is therefore primitive.

We first show that F is a subgroup of Aut Γi,i=1,2,3.

Lemma 1.

Let S1, S2 and S3 be defined as in EquationEquations (1), Equation(2), and Equation(3), respectively. Let Γi=Cay(Fq2,Si), i = 1, 2, 3, be their corresponding Cayley graphs defined above. Then Aut Γi contains F as a subgroup for each i=1,2,3.

Proof.

First, it is obvious that λ(a,b) and R are permutations of V(Γi),i=1,2,3. By Pigeonhole’s Principle, it is enough to show that Ma± and Ai, i = 1, 2, are one-to-one.

Now: (i) Ma+(x1,x2)=Ma+(y1,y2):(ax1,ax2)=(ay1,ay2)(x1,x2)=(y1,y2).

(ii) Ma(x1,x2)=Ma(y1,y2):(ax1,a1x2)=(ay1,a1y2). This implies that ax1 = ay1 and a1x2=a1y2. Thus (x1,x2)=(y1,y2).

(iii) For A1(x1,x2)=A1(y1,y2), we have (x1p,x2)=(y1p,y2) if and only if (x1,x2)=(y1,y2). Similarly, A2(x1,x2)=A2(y1,y2) if and only if (x1,x2)=(y1,y2). Thus every element of F is a permutation of Fq2.

For adjacency, λ(a,b) are left translations. It is a classical result that they are automorphisms of Cayley graphs. Hence they are automorphisms of Γi, i=1,2,3. Since R,Ma±,Ai, i = 1, 2, stabilize 0, it is enough to show that the image of x:=(x1,x2) by the above permutation is also an element of Si, i=1,2,3. Clearly, (x,y)Si if and only if (y,x)Si, for each i=1,2,3. For any (x,y)Si, i = 1, 2; i.e., xyq, we have that Nϕ(ax,ay)=a2xy;Nϕ(ax,a1y)=xy;Nϕ(xp,y)=xpy=xp1·xyq since p is odd;Nϕ(x,yp)=xyp=xy·yp1q since p is odd.

Similar arguments hold as the latter are also valid for (x,y)S3; i.e., xyq. Hence R, Ma±, and Ai, i = 1, 2, are automorphisms of Γi, i=1,2,3. Therefore F is a subgroup of Aut Γi.

Let Λ be the subgroup of F generated by all translations λ(a,b) with a,bFq. The following properties of F hold.

Lemma 2.

[7, Lemma 6] With notation as above we have the following:

  1. Λ is normal in F.

  2. |F|=(q(q1)r)2.

  3. The stabilizer F0 has orbits S0={0}, S1, S2, and S3; where S1 and S2 are given by Equationequations (1) and Equation(2) respectively; and S3=Fq2(S0S1S2). In particular, F has rank 4.

  4. F is primitive.

The orbits Si, i = 1, 2, 3, given in (iii) of Lemma 2 are obviously the Cayley sets in the constituent graphs Γi=Cay(Fq2,Si) as stated above. What follows next, is to study the automorphism groups of each Γi, i = 1, 2, 3, the main thrust of the paper. First, we look at the automorphism group of Γ1.

3.1 The automorphism group of Γ1=Cay(Fq2,S1)

In this section, we fully determine the automorphism group of Γ1=Cay(Fq2,S1) with S1=(Fq*,0)(0,Fq*)={(x1,x2)Fq2{(0,0)}:x1x2=0}. Let x:=(x1,x2) and y:=(y1,y2) be vertices in Γ1. Then x and y are adjacent in Γ1 if and only if Nϕ(xy)=(x1y1)(x2y2)=0; i.e.,

xi = yi for exactly one i = 1,2. We shall say that σAut Γ1 if and only if Nϕ(xy)=0Nϕ(xσyσ)=0.

Since Γ1 is vertex-transitive, it is sufficient to determine the stabilizer (Aut Γ1)0 of (0, 0) in Aut Γ1 (by Orbit-Stabilizer Theorem).

In the subgroup (Aut Γ1)0, σ will permute only the non-zero vectors of Fq2. Here, it can be shown that any permutation in Fq* for exactly one component and any permutation of components in any element of Fq2 is an element of the subgroup (Aut Γ1)0 in the following result.

Lemma 3.

Let H be a permutation group of V(Γ1) generated by R:(x1,x2)(x2,x1);

πσ1:(x1,x2)(x1σ1,x2) and

πσ2:(x1,x2)(x1,x2σ2) where σ1,σ2SFq and 0σi=0,i=1,2.

Then H is a subgroup of the stabilizer (Aut Γ1)0 of (0, 0) in Aut Γ1.

Proof.

Clearly, R, πσi, i = 1, 2, stabilize (0,0). In order to show that H is a subgroup of (Aut Γ1)0, it is sufficient to show that R, πσi, i = 1, 2, preserve the adjacency structure in Γ1.

For any vertices x=(x1,x2) and y=(y1,y2) in Γ1,{x,y}E(Γ1) if and only if (x1y1)(x2y2)=0. It follows that Nϕ(xRyR)=(x2y2)(x1y1)=0. Thus R(Aut Γ1)0. For πσ1:(x1,x2)(x1σ1,x2), we have Nϕ(xπσ1yπσ1)=(x1σ1y1σ1)(x2y2).

Since σ1 is a permutation of Fq, it follows that x1σ1=y1σ1x1=y1. However, if x1 = y1, then x is adjacent to y. Thus xπσ1 is adjacent to yπσ1. With a similar argument applied to πσ1, it can also be shown that πσ2 preserves the adjacency structure of Γ1. Therefore H=R,πσi,i=1,2 is a subgroup of the stabilizer (Aut Γ1)0 of (0, 0) in Aut Γ1.

As we have just shown that H is a subgroup of (Aut Γ1)0, we also show the maximality of H in the symmetric group SS1. (See further details of maximal subgroups of a symmetric group in [Citation1, Citation12]).

Lemma 4.

Let H be defined as in Lemma 3. H is a maximal subgroup of the symmetric group SS1, where S1 is the Cayley set of Γ1.

Proof.

Consider the action of H on S1=(Fq*,0)(0,Fq*). Let Δ=(Fq*,0). Then we have ΔR=(0,Fq*), and Δπσ1=Δπσ2=Δ. So (Fq*,0) and (0,Fq*) are blocks for H.

Let Δ1=(Fq*,0) and Δ2=(0,Fq*). Then it is shown by [12, Proposition 2.1] that the subgroup of SS1 isomorphic to SΔi[2]S[2] is maximal in SS1 (we use the notation S[2] for a symmetric group instead of S2 for a Cayley set). This is also isomorphic to the wreath product SFq*S[2].

Hence it is sufficient to check whether H is isomorphic with the wreath product of SFq* by S[2]. Here we check the normality of R and πσi, i = 1, 2, in H. Let us determine the conjugates of R with πσi, i = 1, 2, and the conjugates of πσi by πσi and R, i,j=1,2 and ij. Clearly, we have R=R1, πσ11:(x1,x2)(x1σ11,x2), and πσ21:(x1,x2)(x1,x2σ21).

It is easily shown that (x1,x2)R1πσ1R=(x1,x2σ1) and (x1,x2)πσ11πσ1πσ2=(x1σ1,x2). This implies that R1πσ1R=πσ2 and πσ21πσ1πσ2=πσ1. Similarly, we have R1πσ2R=πσ1 and πσ11πσ2πσ1=πσ2. It follows that πσ1 and πσ2 commute, and R interchanges πσ1 with πσ2. Thus πσ1,πσ2=πσ1×πσ2 is normal in H, where πσi is isomorphic with SFq*, i = 1, 2, and R is isomorphic with S[2]. Hence H(SFq*×SFq*)S[2]=SFq*S[2]. Therefore H is maximal in SS1.

From the above result, it is convenient to identify the subgroup H of (Aut Γ1)0 with the wreath product SFq*S[2]. Now we have to prove the converse of Lemma 3 to obtain the following.

Corollary 1.

H=(Aut Γ1)0.

Proof.

By maximality of H, this follows immediately. □

As the conclusion on this matter, we have the following result.

Theorem 4.

Let Γ1=Cay(Fq2,S1) with S1=(Fq*,0)(0,Fq*). Let H and Λ=λ(a,b) be the subgroups of Aut Γ1 defined above. Then

  1. Aut Γ1=ΛH;

  2. |Aut Γ1|=2(q!)2.

Proof.

(i) Clearly, the regular subgroup Λ=λ(a,b) of Aut Γ1 is the orbit of the vector (0, 0) in Aut Γ1. By Corollary 1, H=R,πσi,i=1,2 is the stabilizer of (0,0) in Aut Γ1 Thus (i) follows by Orbit-Stabilizer Theorem.

(ii) Now we determine the order of Aut Γ1. First we have |Λ|=|λ(a,b)|=q2; and |H|=|SFq*S[2]|=2((q1)!)2. Thus by Orbit-Stabilizer Theorem, we obtain |Aut Γ1|=|0Aut Γ1||(Aut Γ1)0|=|Λ|·|H|=q2·2((q1)!)2=2(q!)2.

3.2 The automorphism groups of Γ2=Cay(Fq2,S2) and Γ3=Cay(Fq2,S3) with S3=Fq2(S{0}),S=S1S2

In this section, we determine the automorphism group of Γ2=Cay(Fq2,S2) with S2={(x1,x2)Fq2:x1x2q{0}}. Recall that if given sS2,x and y are adjacent vertices in Γ2 if and only if xy=s.

Put x:=(x1,x2) and y:=(y1,y2). Then we have s=(x1y1,x2y2). That is, sS2 if and only if (x1y1)(x2y2)q{0}. This implies that the corresponding components should not equal as in the previous case of Γ1; i.e., x1y1 and x2y2.

By Lemma 1, Aut Γ2 contains the group F generated by the permutations λa,b, R, Ma±, and Ai, i = 1, 2, and hence primitive by Lemma 2(iv). According to the results from Theorem 2 and Lemma 1, we find that the results for this case are the same as in Lemmas 1 and 2, so that Aut Γ2 and Aut Γ,Γ=Cay(Fq2,S), may be isomorphic.

To see the isomorphism between Aut Γ2 and Aut Γ, we have to look at the isomorphism of graphs Γ2=Cay(Fq2,S2) and Γ3=Cay(Fq2,S3), with S3=Fq2(S{0}),S=S1S2.

Lemma 5.

Consider the graphs Γ2=Cay(Fq2,S2) and Γ3=Cay(Fq2,S3) with S3=Fq2(S1S2{0}). The linear mapping τα:V(Γ2)V(Γ3) defined by τα:(x1,x2)(αx1,x2) with αqis an automorphism of Fq2.

Proof.

It can be easily verified that τα is Fq-linear. Now, suppose that we have xτα=yτα. Then (x1,x2)τα=(y1,y2)τα:(αx1,x2)=(αy1,y2). This is equivalent to αx1=αy1 and x2=y2. Thus x1 = y1 and x2=y2. By Pigeonhole’s Principle it follows that τα is a bijection and hence an automorphism of Fq2.

Corollary 2.

Let Γ2 and Γ3 be graphs defined above. Then

  1. Γ2Γ3;

  2. Aut Γ=Aut Γ3Aut Γ2.

Proof.

(i) Consider the Cayley sets S2 and S3 corresponding to the graphs Γ2 and Γ3, respectively.

Let x:=(x1,x2) be an element of S2. Then Nϕ(x)=x1x2q{0}. With the linear mapping τα:V(Γ2)V(Γ3) defined in Lemma 5 for any αq, it follows that xτα=(αx1,x2) and Nϕ(xτα)=αx1x2q. Thus xταFq2(S1S2{0})=S3 and hence S2ταS3. Since τα is an automorphism of Fq2 by Lemma 5, it follows that S2τα=S3. Therefore, (i) follows immediately by Proposition 1.

(ii) This follows immediately from (i) since Γ3 is the complement of Γ.

With the results above, we conclude that the automorphism group of Γi=Cay(Fq2,Si), i = 2, 3, is isomorphic to the automorphism group of Γ=Cay(Fq2,S),S=S1,S2. Hence, it is sufficient to determine Aut Γ.

For the graph Γ=Cay(Fq2,S) with the proof of Lemma 1, it can be deduced that Aut Γ contains the group F generated by λ(a,b), R, Ma±, and Ai, i = 1, 2, defined in the beginning of this section.

Recall that S=Sϕ so that Aut Γ=Aut(Cay(Fq2,Sϕ))=ϕ1Aut(Fq2)ϕ. Let G:=ϕFϕ1Aut(Fq2). Then |G|=(q(q1)r)2 by Lemma 2. Hence, it follows that G is isomorphic to the group AffAut(Fq2),ψ described in [Citation6].

Since Cay(Fq2,S) is isomorphic to Γ, Theorem 2 is equivalent to the following statement with further details for a proof given in [Citation7].

Theorem 5.

[7, Theorem 5] With notations as above, if q{5,9}, then |Aut Γ|=(q(q1)r)2.

From the former results with Theorem 4, we determine the orders of Aut Γ2 and Aut Γ3 in the following.

Corollary 3.

Let Γ2=Cay(Fq2,S2) and Γ3=Cay(Fq2,S3),q{5,9}, with S2={(x1,x2)Fq2:x1x2q*} and S3=Fq2(S{0}),S=S1S2. Then |Aut Γ2|=|Aut Γ3|=(q(q1)r)2.

Proof.

This follows immediately from Theorem 4 and Corollary 2(ii) □

References

  • Ball, R. W. (1966). Maximal subgroups of symmetric groups. Trans. Amer. Math. Soc. 121(2): 393–407.
  • Elsawy, A. N. (2009). Paley graphs and their generalisation Master’s Thesis. Heinrich Heine University, Dússeldorf, Germany.
  • Godsil, C, Royle, G. (2001). Algebraic Graph Theory. New York: Springer-Verlag.
  • Habineza, O. (2021). Graphs of Integral Distances and Their Properties PhD Thesis. University of the Western Cape, Bellville, South Africa.
  • Iosevich, A, Rudnev, M. (2003). A combinatorial approach to orthogonal exponentials. Int. Math. Res. Not 49: 1–12.
  • Kiermaier, M, Kurz, S. (2009). Maximal integral point sets in affine planes over finite fields. Discrete Math 309(13): 4564–4575.
  • Kovács, I, Ruff, J. (2014). Integral automorphisms of affine planes over finite fields. Finite Fields Their Appl 27: 104–114.
  • Kovács, I., Kutnar, K., Ruff, J, Szőnyi, T. (2017). Integral automorphisms of affine spaces over finite fields. Des Codes Cryptogr. 84(1-2): 181–188.
  • Kurz, S. (2009). Integral point sets over finite fields. Australas J. Combin 43: 3–29.
  • Kurz, S, Meyer, H. (2009). Integral point sets in higher dimensional affine spaces over finite fields. J. Comb. Theory, Ser. A 116(6): 1120–1139.
  • Mwambene, E. (2001). Representing graphs on groupoids: symmetry and form PhD Thesis. University of Vienna, Vienna, Austria.
  • Newton, B, Benesh, B. (2006). A classification of certain maximal subgroups of symmetric groups. J. Algebra 304(2): 1108–1113.