Next Article in Journal
Optimal Harvest Problem for Fish Population—Structural Stabilization
Next Article in Special Issue
Left (Right) Regular and Transposition Regular Semigroups and Their Structures
Previous Article in Journal
Modified Elliptic Integral Approach for the Forced Vibration and Sound Transmission Analysis of a Nonlinear Panel Backed by a Partitioned Cavity
Previous Article in Special Issue
On Cyclic Associative Semihypergroups and Neutrosophic Extended Triplet Cyclic Associative Semihypergroups
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Basic Locally Primitive Graphs of Order Twice a Prime Square

1
School of Mathematics and Statistics, Yunnan University, Kunming 650031, China
2
School of Sciences, Xichang University, Xichang 615000, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(6), 985; https://doi.org/10.3390/math10060985
Submission received: 15 February 2022 / Revised: 13 March 2022 / Accepted: 15 March 2022 / Published: 18 March 2022
(This article belongs to the Special Issue Algebra and Discrete Mathematics 2021)

Abstract

:
A graph Γ is called G-basic if G is quasiprimitive or bi-quasiprimitive on the vertex set of Γ , where G Aut ( Γ ) . It is known that locally primitive vertex-transitive graphs are normal covers of basic ones. In this paper, a complete classification of the basic locally primitive vertex-transitive graph of order 2 p 2 is given, where p is an odd prime.

1. Introduction

Throughout this paper, graphs are assumed to be connected, undirected and simple unless otherwise stated, and groups are assumed to be finite. For a graph Γ , the notation V Γ , E Γ and Aut ( Γ ) are denoted by its vertex set, edge set, and full group of automorphism respectively. Let G Aut ( Γ ) be a group of automorphism of Γ . Then, Γ is called G-vertex-transitive or G -edge-transitive if G is transitive on V Γ or E Γ respectively.
An arc in Γ is an ordered pair of edges. The graph Γ is called G-arc transitive if G acts transitively on the set of all arcs in Γ . For each α V Γ , let Γ ( α ) = { β V Γ | { α , β } E Γ } be the set of vertices to which α is adjacent. Then, Γ is called G-locally primitive if the stabilizer G α = { x G | α x = α } acts primitively on Γ ( α ) .
A graph Γ is called ( G , s ) -arc-transitive for a positive integer s if G acts transitively on the set of s-arcs of Γ . Then, the Γ is called G-arc-transitive (namely symmetric graph) when s = 1 . Γ is called ( G , s ) -transitive if it is ( G , s ) -arc-transitive but not ( G , s + 1 ) -arc-transitive. We know that the ( G , s ) -arc-transitive graphs with s 2 and the arc-transitive graphs with prime valency are both locally primitive. If Γ is G-locally primitive, then it is G-edge transitive.
Moreover, if Γ is both G-vertex transitive and G-locally primitive, then Γ is also G-arc transitive; in this case, Γ is called G-locally primitive arc-transitive. A permutation group G on a set Ω is called quasiprimitive if each nontrivial normal subgroup of G is transitive on Ω . The group G is called bi-quasiprimitive if each nontrivial normal subgroup of G has at most two orbits and there exists at least one normal subgroup of G that has exactly two orbits. A graph Γ is called G-basic if G is quasiprimitive or bi-quasiprimitive on V Γ for some G Aut Γ .
The study of locally primitive graphs has a long and rich history and has been one of the central topics in algebraic graph theory for decades, see for example [1,2]. The main approach to study locally primitive graphs is global-action analysis, which was first systematically investigated by Cheryl Praeger in 1992 [2]. It proved that if a graph Γ is G-locally primitive arc-transitive then either Γ is a G-basic graph or a normal cover of the basic graphs. In this paper, we mainly study the basic locally primitive arc-transitive graphs of order 2 p 2 . The classification of some special symmetric graphs of order 2 p 2 has received much attention in the literature.
For instance, references [3,4,5,6] gave a classification of arc-transitive graphs of order 2 p 2 with valency 3, 5 and 7. Reference [7] showed that if a graph of order 2 p 2 is both vertex transitive and edge transitive, then it must be arc transitive. Recently, reference [8] gave a classification of tetravalent non-normal Cayley graphs of order 2 p 2 . Here, we characterised the locally primitive arc-transitive graphs of order 2 p 2 . There are many typical examples, including:
(i)
the complete graph K 2 p 2 ;
(ii)
the complete bipartite graph K p 2 , p 2 ;
(iii)
the graph K p 2 , p 2 p 2 K 2 obtained by deleting a 1-factor from K p 2 , p 2 ;
(iv)
the incidence graph PH ( d , q ) and the nonincidence graph PH ¯ ( n , q ) of the projective geometry PG ( d 1 , q ) , where n 3 and q n 1 q 1 = p 2 ;
(v)
the bidirect square of the incidence graph D 2 1 ( 11 , 5 ) and the nonincidence graph D ¯ 2 1 ( 11 , 5 ) of the 2 ( 11 , 5 , 1 ) -design; and
(vi)
the bidirect square of PH ( d , q ) and PH ¯ ( n , q ) , where q n 1 q 1 = p .
This paper gives a classification of vertex quasiprimitive or bi-quasiprimitive locally primitive graph of order 2 p 2 . The case when p = 2 is characterised in [9]. The main result of the paper is stated as follows.
Theorem 1.
Let Γ be a G-locally primitive graph of order 2 p 2 with valency at least three, where G Aut ( Γ ) and p is an odd prime. Assume that G is quasiprimitive or biquasiprimitive on the vertices of Γ . Then, Γ is either the bi-normal Cayley graph of the generalized dihedral group Dih ( Z p 2 ) , or one of the following graphs:
(1) 
Γ K 2 p 2 , K p 2 , p 2 , K p 2 , p 2 p 2 K 2 ;
(2) 
Γ HS ( 50 ) is Hoffman–Singleton graph, and G = PSU ( 3 , 5 ) . Z 2 ;
(3) 
PH ( n , q ) or PH ¯ ( n , q ) , where n 3 and q n 1 q 1 = p 2 ;
(4) 
the standard double cover of Σ × 2 , where Σ = K p ; or
(5) 
Γ Σ × b i 2 , a bidirect square of Σ , where Σ = D 2 1 ( 11 , 5 ) or D ¯ 2 1 ( 11 , 5 ) , PH ( n , q ) or PH ¯ ( n , q ) with q n 1 q 1 = p .
After the introduction, we give some preliminary results in Section 2. In Section 3, we study the basic graphs and complete the proof of Theorem 1.

2. Preliminary Results

First, we collect the description of the eight types of quasiprimitive permutation groups. Let G be a quasiprimitive permutation group on Ω and let N = soc ( G ) , the socle of G. Then, either N is the unique minimal normal subgroup of G or N is the product of two isomorphic and nonabelian minimal normal subgroups of G. Thus, N = T 1 × × T k , where k 1 and T is simple. Quasiprimitive permutation group G is divided into eight different types according to the structure and the action of N by O’Nan–Scott’s theorem. This was obtained by Praeger in 1992; see [2].
Theorem 2.
Let G be a quasiprimitive permutation group on Ω and N = soc ( G ) . Then, G is one of the eight types as follows:
(1) 
HA : N is abelian, and thus N = Z p k is regular on Ω and G H o l ( N ) = A G L ( d , p ) , where p is a prime and k 1 ;
(2) 
HS : N = M × L such that M L T are nonabelian simple and regular on Ω , and G H o l ( T ) = T : Aut ( T ) ;
(3) 
HC : N = M × L such that M L T l with l 2 and T nonabelian simple, and G H o l ( M ) = M : Aut ( M ) ;
(4) 
AS : N = T is a nonabelian simple group, and T G Aut ( T ) ;
(5) 
SD : N = T k with k 2 and T nonabelian simple, and N ω = { ( t , t , , t ) | t T } T for each ω Ω ;
(6) 
CD : N = T k with k 2 and T nonabelian simple, and N ω T l with l 2 and l | k , where ω Ω ;
(7) 
TW : N is nonabelia, non-simple and minimal normal in G acting regularly on Ω ; and
(8) 
PA : N is a nonabelian minimal normal subgroup that has no regular normal subgroup.
Let a and d be positive integers. A prime r is called a primitive prime divisor of a d 1 if r divides a d 1 but not a i 1 for 1 i < d . The following lemma is a well-known result called the Zsigmondy theorem.
Lemma 1
([10], p. 508). For any positive integers a and d, either a d 1 has a primitive prime divisor, or ( d , a ) = ( 6 , 2 ) or ( 2 , 2 m 1 ) , where m 2 .
The next lemma can be easily obtained by Lemma 1.
Lemma 2.
Let q = r f with r a prime and f a positive integer. Assume that p is an odd prime and n, m, s are positive integers. Then, the following statements hold.
(1) 
If q n 1 q 1 = p m , then n is a prime.
(2) 
If q n 1 q 1 = 2 p s , then n = 2 .
The following lemma may be deduced from the classification of permutation groups of the degree of a product of two prime powers (refer to [11]).
Lemma 3.
Let T be a nonabelian simple group that has a subgroup H of index 2 p 2 with p a prime. Then, T, H and | T : H | are as in Table 1.
Remark 1.
P 1 = [ q n 1 ] : ( Z q 1 ( n , q 1 ) . PSL ( n 1 , q ) ) H 1 . Z 4 , which is the parabolic subgroup of PSL ( n , q ) .
The following lemma presents the non-abelian simple groups with a subgroup of prime-power index.
Lemma 4
(Guralnick [12]). Let T be a non-abelian simple group with a subgroup H of index p e . Then, T and H are listed in Table 2. Further, either T is 2-transitive on [ T : H ] or T = PSU ( 4 , 2 ) .
A group X is called a generalized dihedral group, if there exists an abelian subgroup H and an involution τ such that X = H : τ and h τ = h 1 for each h H . This group is denoted by Dih ( H ) . Locally primitive graphs must be edge-transitive. The following result can be easily obtained from ([13] Lemma 2.4).
Lemma 5.
Let Γ be a G-locally primitive graph of valency k, where G Aut ( Γ ) . Assume that G contains an abelian normal subgroup N that has exactly two orbits on V Γ . Then, Γ is a bi-normal Cayley graph of the generalized dihegral group Dih ( N ) .
Let Σ i be a connected graph with vertex set V i , where i = 1 or 2. Recall that the direct product Σ 1 × Σ 2 is the graph with vertex set V 1 × V 2 such that two vertices ( v 1 , v 2 ) and ( v 1 , v 2 ) are adjacent if and only if v i and v i are adjacent in Σ i for i = 1 and 2. For convenience, we denote Σ × 2 = Σ × Σ .
For a graph Σ with vertex set V, the standard double cover is defined to be the graph Σ ¯ with the vertex set V × { 1 , 2 } and two vertices ( α , i ) and ( β , j ) are adjacent if and only if i j and α and β are adjacent in Σ . It is easily shown that Σ ¯ = Σ × K 2 , a bipartite graph with biparts V × { 1 } and V × { 2 } . Clearly, the standard double cover of K n is K n , n n K 2 .
Lemma 6
([14] Lemma 3.3). Let Γ = ( V , E ) be a connected bipartite graph with biparts B 1 and B 2 . Assume that G Aut ( Γ ) is transitive on E and intransitive on V such that G α and G β are conjugate in G, where α B 1 and β B 2 . Then, Γ is the standard double cover of the orbital graph Σ of G acting on B 2 . Furthermore, Γ is G-locally primitive if and only if Σ is.
We end this section by introducing the definition of the bidirect product of graphs. Let Σ be a connected bipartite graph with biparts U and W. The bidirect square Σ × b i 2 is defined to be the graph with vertex set ( U × U ) ( W × W ) such that ( u 1 , u 2 ) ( w 1 , w 2 ) if and only if that both u 1 w 1 and u 2 w 2 in Σ (where ∼ denotes adjacency). Clearly, Σ × b i 2 is a connected component of Σ × 2 .

3. Basic Graphs

In this section, let Γ be a G-locally primitive and vertex-transitive graph of order 2 p 2 , where G Aut Γ and p is an odd prime. The vertex-quasiprimitive case is considered in Section 3.1, and the vertex-biquasiprimitive case is studied in Section 3.2.

3.1. Vertex-Quasiprimitive Case

Suppose that G is quasiprimitive on V Γ . Then, G is a permutation group of degree 2 p 2 . Set N : = soc ( G ) , which is the product of all minimal normal subgroups of G. By Theorem 2, G is of type AS or PA .
We first give an example satisfying the main theorem.
Example 1.
Let X = PSU ( 3 , 5 ) . Z 2 and H ( S 7 ) be a maximal subgroup of X . By Magma, there exists an involution g X H such that H , g = X and H H g = A 6 . Z 2 . Define a coset graph HS ( 50 ) : = Cos ( X , H , H g H ) . A calculation by Magma shows that Aut ( Γ ) = X , H S ( 50 ) is ( X , 3 ) -transitive, which is essentially the Hoffman–Singleton graph of order 50 with valency 7.
Now, we consider the case that G is almost simple.
Lemma 7.
Suppose that G is almost simple and quasiprimitive on V Γ . Then, Γ is 2-arc transitive, and Γ is one of the following:
(1) 
Γ K 2 p 2 and soc ( G ) = A 2 p 2 or PSL ( 2 , q ) ;
(2) 
Γ HS ( 50 ) is a Hoffman–Singleton graph, which is a 3-transitive non-Cayley graph.
Proof. 
Note that G is quasiprimitive on V Γ and T = soc ( G ) . Then
G α / T α G α / T G α T G α / T G / T O ,
where O Out ( T ) . Thus, G is primitive if and only if T is primitive, and | V Γ | = | α G | = | α T | = | T : T α | = 2 p 2 for some α V Γ . Thus, the couple ( T , T α ) is listed in Table 1.
For row 1, T = soc ( G ) = A 2 p 2 is primitive on V Γ , and T is 2 -transitive on [ T : T α ] . Thus, it follows that Γ K 2 p 2 is a complete graph. Since G = Aut ( Γ ) = S 2 p 2 , Γ is ( G , 2 ) -arc transitive. Clearly, Γ is G -locally primitive arc-transitive.
For row 2, T = soc ( G ) = PSU ( 3 , 5 ) , and T α = A 7 . Since G α is primitive on Γ ( α ) , the arc stabilizer G α β is a maximal subgroup of the vertex stabilizer G α for each β Γ ( α ) . Note that G / T G α / T α Out ( T ) . Then, T α β is a maximal subgroup of T α . Thus, k = val ( Γ ) = | G α : G α β | = | T α : T α β | . By Atlas [15], one knows that the possible value of k is 7 , 21 or 35 . If k = 7 , by Example 1, Γ HS ( 50 ) , which is a 3-transitive non-Cayley graph. If k = 21 or 35, by Magma, T α β = PSL ( 2 , 7 ) , S 5 or ( A 4 × Z 3 ) : Z 2 . In these cases, one has that N T ( T α β ) = T α β . Thus, Γ is not connected. Therefore, there is no graphs in these cases.
For row 3, T = soc ( G ) = PSL ( 2 , q ) , and T α = [ q ] : Z q + 1 , which is a parabolic subgroup of T. Since PSL ( 2 , q ) is 2-transitive on V Γ = [ T : T α ] with q = 2 p 2 1 . Hence, Γ K 2 p 2 with val ( Γ ) = q , and PSL ( 2 , q ) G P Γ L ( 2 , q ) .
Finally, let T = PSL ( n , q ) and T α = H 1 . Note that q n 1 q 1 = p 2 . By Lemma 2, n is a prime. Suppose that n = 2 . Note that ( p + 1 ) ( p 1 ) = q = 2 e . It follows that p = 3 and e = 3 . Thus, T = PSL ( 2 , 8 ) and P 1 Z 2 3 : Z 7 , and thus T α = H 1 D 14 . Now, | T : T α | = 36 2 p 2 , a contradiction occurred. Suppose that n 3 . If ( n , q ) = ( n , 2 e ) = ( 3 , 2 ) , then T = PSL ( 3 , 2 ) PSL ( 2 , 7 ) and T α = H 1 D 6 . Now, | V Γ | = | T : T α | = 28 2 p 2 for any prime p, which is a contradiction. Assume that ( n , q ) = ( 3 , 2 e ) and e 2 . Let r be an odd prime divisor of q + 1 = 2 e + 1 . As ( q 1 , q + 1 ) = ( 2 e 1 , 2 e + 1 ) = 1 , we have that ( r , q ( q 1 ) ) = ( r , 2 e ( 2 e 1 ) ) = 1 .
Now, it follows that ( r , | P 1 | | PSL ( n 1 , q ) | ) = 1 . Since ( q + 1 ) | | H 1 | , | H 1 | and | H 1 Γ ( α ) | have the same prime divisors, one has that r | | H 1 Γ ( α ) | . It follows that PSL ( n 1 , q ) = PSL ( 2 , 2 e ) is a combinatorial factor of H 1 Γ ( α ) . As H 1 Γ ( α ) = T α Γ ( α ) is a primitive permutation group, it concludes with Theorem 2 that T α Γ ( α ) is almost simple and soc ( T α Γ ( α ) ) = PSL ( 2 , 2 e ) . By checking the maximal subgroup of PSL ( 2 , 2 e ) , we have that either 2 e = 11 or 2 e + 1 is a prime. Clearly, the former case is impossible. For the later case that 2 e + 1 is a Fermat prime, then e = 2 f for some positive integer f. Now, q 2 + q + 1 = 2 2 e + 2 e + 1 = ( 2 e + 1 ) 2 2 e = ( 2 2 f + 1 ) 2 ( 2 2 f 1 ) 2 = ( 2 2 f + 1 + 2 2 f 1 ) ( 2 2 f + 1 2 2 f 1 ) . By easy calculation, there exists no prime p satisfying q 2 + q + 1 = p 2 .
Assume that n 4 . If ( n , q ) = ( 7 , 2 ) , then 7 | | H 1 | , but 7 | P 1 | | PSL ( n 1 , q ) | = | P 1 | | PSL ( 6 , 2 e ) | . If ( n , q ) ( 7 , 2 ) , then by Lemma 1 q n 1 1 has a primitive prime divisor, say r, and r | P 1 | | PSL ( n 1 , q ) | . Since | H 1 | and | H 1 Γ ( α ) | have the same prime divisors, we conclude that PSL ( n 1 , q ) is a combinatorial factor of H 1 Γ ( α ) . Hence, the primitive permutation group H 1 Γ ( α ) is almost simple with socle PSL ( n 1 , q ) . Thus, q n 1 1 q 1 = ( 2 e ) n 1 1 2 e 1 is a prime. It follows from Lemma 2 that n 1 is a prime, noting that n is a prime. Then, n = 3 , which is a contradiction with the assumption. □
The following lemma considers the case that G is of type PA .
Lemma 8.
Suppose that G is a quasiprimitive permutation group of product action type on V Γ . Then, no graphs appear.
Proof. 
By assumption, let N = soc ( G ) = T × × T = T d . Then, N is not regular and also has no subgroup that is regular on V Γ . Further, there exists an almost simple group U with socle T satisfying that G U S d . If U is a permutation group on a set Δ , then V Γ : = Δ × × Δ = Δ d . For a vertex α = ( δ , , δ ) V Γ , then | N : N α | = | T : T δ | d = 2 p 2 , it follows that d = 1 , which is a contradiction with d 2 . □

3.2. Vertex-Biquasiprimitive Case

Suppose that G acts biquasiprimitively on V Γ with biparts B 1 , B 2 . Then, V Γ = B 1 B 2 and | B 1 | = | B 2 | = p 2 . Set G + = G B 1 = { g G | B 1 g = B 1 } . Then, G + = G B 2 . Clearly, G + is the normal subgroup of G with index 2 and quasiprimitive on B 1 and B 2 .
If G + acts unfaithfully on B 1 or B 2 , by reference [16] (Lemma 5.2), Γ K p 2 , p 2 and Z p 2 2 : Z 2 G Aut ( K p 2 , p 2 ) = S p 2 Z 2 . Suppose that G + acts faithfully on both B 1 and B 2 . By [9] (Theorem 2.2), quasiprimitive permutation groups of prime-power degree is primitive. Then, G + is primitive on both B 1 and B 2 . Thus, G is a biprimitive permutation group on V Γ . By Lemma 4 and Theorem 2, the following result is obtained.
Lemma 9.
Suppose that G + is faithful on both B 1 and B 2 . Then the actions of G + on B i are permutationally isomorphic, and one of the following holds:
(1) 
G + is affine and soc ( G + ) = Z p 2 ;
(2) 
G + is almost simple and soc ( G + ) = A p 2 or PSL ( n , q ) with n , q satisfying q n 1 q 1 = p 2 . In addition, G + is 2-transtive on B i , i = 1 , 2 ;
(3) 
G + is of product action type and soc ( G + ) = T 2 , where T = A p , M 11 , M 23 , PSL ( 2 , 11 ) , or PSL ( n , q ) with n , q satisfying q n 1 q 1 = p .
The next lemma determines the graph according to the structure of G + .
Lemma 10.
Let Γ be a G-locally primitive graph, and G be biquasiprimitive on V Γ with biparts B 1 and B 2 . Assume that G + = G B 1 = G B 2 is faithful on both B 1 and B 2 . Then, one of the followings holds:
(1) 
Γ is a bi-normal Cayley graph of the generalized dihedral group Dih ( Z p 2 ) ;
(2) 
Γ K p 2 , p 2 p 2 K 2 , PH ( n , q ) or PH ¯ ( n , q ) with q n 1 q 1 = p 2 ;
(3) 
Γ is the standard double cover of Σ × 2 , where Σ = K p × 2 ; and
(4) 
Γ = Σ × b i 2 , where Σ = D 2 1 ( 11 , 5 ) , D ¯ 2 1 ( 11 , 5 ) , PH ( n , q ) or PH ¯ ( n , q ) with q n 1 q 1 = p .
Proof. 
By Lemma 9, G + is a primitive permutation group of p 2 degree and is of type HA , AS or PA .
Assume that G + is of type HA . Then, N : = soc ( G + ) = Z p 2 , which is regular on B i . Since N char G + and G + G , we have that N G . By Lemma 5, Γ is stated as in ( 1 ) ;
Assume that G + is of type AS . Let soc ( G + ) = T . Then, T is non-abelian simple and transitive on both B 1 and B 2 . Let C = C G ( T ) be the centralizer of T in G. Then, C G . Suppose that C 1 . Since C G + = C G + ( T ) = 1 , it follows that C , G + = C × G + = G , and thus C = g Z 2 , where g interchanges B 1 and B 2 . Clearly, C is semiregular and has p 2 orbits on V Γ . Now, the quotient graph Γ C induced by C is a G + -locally primitive arc-transitive graph of order p 2 . By [17] (Lemma 2.2), Γ is the standard double cover of Γ C . By Lemma 9 (2), we know that G + is 2-transitive on V Γ C . Thus, Γ C = K p 2 . It follows that Γ K p 2 , p 2 p 2 K 2 .
Suppose that C = 1 . Then, T G Aut ( T ) . Thus, G is an almost simple group. Assume that the induced permutations ( G + ) B 1 and ( G + ) B 2 are permutation equivalent. By Lemma 4, G + is 2-transitive on B i , so the orbital graph of G + acting on B i is K p 2 . For α B 1 and β B 2 , because G α and G β are conjugate in G, by Lemma 6, Γ is the standard double cover of K p 2 . Thus, Γ K p 2 , p 2 p 2 K 2 . Assuming that ( G + ) B 1 and ( G + ) B 2 are permutation inequivalent, by Lemma 4, T = PSL ( n , q ) and n , q satisfy q n 1 q 1 = p 2 . As G α and G β are not conjugate in G , we get Γ PH ( n , q ) or PH ¯ ( n , q ) from [14] (Example 3.6).
Assume that the action of G + on B i is of type PA . By Lemma 9, N = soc ( G + ) = T × T , where T is stated as in ( 3 ) of Lemma 9. Noting that G + is transitive on B i and G α = G α + , then the orbital graph Σ of G + acting on B 2 is G-locally primitive arc transitive. Let V Σ = B 2 = Δ × Δ . For a vertex α = ( δ , δ ) V Σ , since G α Σ ( α ) is primitive, we have that Σ ( α ) is an orbit of G α on B 2 { α } . By [14] (Lemma 2.4), Σ ( α ) = Δ ( δ ) 2 , where Δ ( δ ) is an orbit of H in Δ { δ } and H is almost simple with socle T and primitive on Δ satisfying that G + H S 2 . It follows that Σ = Π × Π = Π × 2 . Since T = A p , M 11 , M 23 , PSL ( 2 , 11 ) , or PSL ( n , q ) with n , q satisfying q n 1 q 1 = p , which are 2-transitive on Δ . We conclude that Π = K p is a complete graph. That is Σ = K p × 2 .
Suppose that ( G + ) B 1 and ( G + ) B 2 are permutation equivalent. By Lemma 6, Γ is the standard double cover of Σ = K p × 2 . Suppose that ( G + ) B 1 and ( G + ) B 2 are permutation inequivalent. By Lemma 9, T = PSL ( 2 , 11 ) , and T δ 1 T δ 2 A 5 or T = PSL ( n , q ) acts on 1-subspace or hyperplane of n-dimensional linear space over the field F q and n , q satisfying that q n 1 q 1 = p . Since Γ is N-edge transitive, N b 1 and N b 2 are not conjugate in N, by [14] (Lemma 3.9), Γ = Σ × b i 2 , is a bidirect product of Σ , where Σ = D 2 1 ( 11 , 5 ) , D ¯ 2 1 ( 11 , 5 ) , PH ( n , q ) , PH ¯ ( n , q ) . □
Proof of Theorem 1.
Now, we are ready to complete the proof of the main Theorem 1. Let Γ be a G-locally primitive graph of order 2 p 2 , where p is an odd prime.
Assume that G is quasiprimitive on V Γ . By Lemmas 7 and 8, Γ is the complete graph K 2 p 2 or the Hoffman–Singleton graph HS ( 50 ) . Thus, the graphs in Theorem 1 (1), (2) hold.
Assume that G is biquasiprimitive on V Γ . Then, Γ = K p 2 , p 2 or the standard double cover of K p 2 . By Lemma 10, either Γ is a bi-normal Cayley graph on the generalized dihedral group Dih ( Z p 2 ) , or Γ is the graph as in Theorem 1 (3)–(5). Thus, the proof of Theorem 1 is completed. □

Author Contributions

Y.M.: writing—original draft, B.L.: supervision, writing, review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

The work was supported by the National Natural Science Foundation of China (11861076, 12061089) and the Natural Science Foundation of Yunnan Province (2019FB139).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Conder, M.D.; Li, C.H.; Praeger, C.E. On the Weiss conjecture for finite locally primitive graphs. Proc. Edinb. Math. Soc. 2000, 43, 129–138. [Google Scholar] [CrossRef] [Green Version]
  2. Praeger, C.E. An O’Nan-Scott theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs. J. Lond. Math. Soc. 1993, 2, 227–239. [Google Scholar] [CrossRef]
  3. Zhou, J.X. Cubic vertex-transitive graphs of order 2p2. Adv. Math. 2008, 37, 605–609. [Google Scholar]
  4. Yu, H.X.; Zhou, J.X.; Wang, L.L. Cubic Cayley graph of order 2p2. Adv. Math. 2006, 35, 581–589. [Google Scholar]
  5. Hua, X.H.; Feng, Y.Q.; Lee, J. Pentavalent symmetric graphs of order 2pq. Discret. Math. 2011, 311, 2259–2267. [Google Scholar] [CrossRef] [Green Version]
  6. Hua, X.H.; Chen, L. Valency seven symmetric graphs of order 2pq. Czechoslov. Math. J. 2018, 68, 581–599. [Google Scholar] [CrossRef]
  7. Zhou, J.X.; Zhang, M.M. On weakly symmetric graphs of order twice a prime square. J. Comb. Theory Ser. A 2018, 155, 458–475. [Google Scholar] [CrossRef]
  8. Cui, L.; Zhou, J.X.; Ghasemi, M.; Talebi, A.A.; Varmazyar, R. A classification of tetravalent non-normal Cayley graphs of order twice a prime square. J. Algebr. Comb. 2021, 53, 663–676. [Google Scholar] [CrossRef]
  9. Li, C.H.; Pan, J.M.; Ma, L. Locally primitive graphs of prime-power order. J. Aust. Math. Soc. 2009, 86, 111–122. [Google Scholar] [CrossRef] [Green Version]
  10. Huppert, B. Endliche Gruppen I; Springer: Berlin/Heidelberg, Germany, 1967. [Google Scholar]
  11. Li, C.H.; Li, X.H. On permutation groups of degree a product of two prime-powers. Commun. Algebra 2014, 42, 4722–4743. [Google Scholar] [CrossRef]
  12. Guralnick, R.M. Subgroups of prime power index in a simple group. J. Algebra 1983, 81, 304–311. [Google Scholar] [CrossRef] [Green Version]
  13. Liu, H.L.; Lou, B.G. Pentavalent arc-transitive graphs of order 2p2q. Taiwan J. Math. 2018, 22, 767–777. [Google Scholar] [CrossRef]
  14. Li, C.H.; Ma, L. Locally primitive graphs and bidirect products of graphs. J. Aust. Math. Soc. 2011, 91, 231–242. [Google Scholar] [CrossRef]
  15. Conway, J.H.; Cutis, R.T.; Norton, S.P.; Parker, R.A.; Wilson, R.A. Atlas of Finite Groups; Oxford University Press: London, UK; New York, NY, USA, 1985. [Google Scholar]
  16. Giudici, M.; Li, C.H.; Praeger, C.E. Analysing finite locally s-arc transitive graphs. Trans. Am. Math. Soc. 2004, 356, 291–317. [Google Scholar] [CrossRef]
  17. Li, C.H.; Lou, B.G.; Pan, J.M. Finite locally primitive abelian Cayley graphs. Sci. China Ser. A 2011, 54, 845–854. [Google Scholar] [CrossRef]
Table 1. Non-abelian simple group containing subgroups with index 2 p 2 .
Table 1. Non-abelian simple group containing subgroups with index 2 p 2 .
RowTH | T : H | Remark
1 A 2 p 2 A 2 p 2 1 2 p 2
2 PSU ( 3 , 5 ) A 7 2 · 5 2
3 PSL ( n , q ) P 1 2 p 2 = q n 1 q 1 n = 2 , and q = 2 e
4 PSL ( n , q ) H 1 2 p 2 = 2 q n 1 q 1 q = 2 e
Table 2. Non-abelian simple group containing subgroups with index p e .
Table 2. Non-abelian simple group containing subgroups with index p e .
RowTH | T : H |
1 A p e A p e 1 p e
2 PSL ( n , q ) P 1 p e = q n 1 q 1
3 PSL ( 2 , 11 ) A 5 11
4 M 11 M 10 11
5 M 23 M 22 23
6 PSU ( 4 , 2 ) Z 2 4 : A 5 27
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ma, Y.; Lou, B. The Basic Locally Primitive Graphs of Order Twice a Prime Square. Mathematics 2022, 10, 985. https://doi.org/10.3390/math10060985

AMA Style

Ma Y, Lou B. The Basic Locally Primitive Graphs of Order Twice a Prime Square. Mathematics. 2022; 10(6):985. https://doi.org/10.3390/math10060985

Chicago/Turabian Style

Ma, Yulong, and Bengong Lou. 2022. "The Basic Locally Primitive Graphs of Order Twice a Prime Square" Mathematics 10, no. 6: 985. https://doi.org/10.3390/math10060985

APA Style

Ma, Y., & Lou, B. (2022). The Basic Locally Primitive Graphs of Order Twice a Prime Square. Mathematics, 10(6), 985. https://doi.org/10.3390/math10060985

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop