Abstract
A graph is called G-basic if G is quasiprimitive or bi-quasiprimitive on the vertex set of , where . 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 is given, where p is an odd prime.
MSC:
20B25; 05E18
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 , and are denoted by its vertex set, edge set, and full group of automorphism respectively. Let be a group of automorphism of . Then, is called G-vertex-transitive or -edge-transitive if G is transitive on or 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 , let be the set of vertices to which is adjacent. Then, is called G-locally primitive if the stabilizer acts primitively on .
A graph is called -arc-transitive for a positive integer s if acts transitively on the set of s-arcs of . Then, the is called G-arc-transitive (namely symmetric graph) when . is called -transitive if it is -arc-transitive but not -arc-transitive. We know that the -arc-transitive graphs with 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 for some .
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 . The classification of some special symmetric graphs of order has received much attention in the literature.
For instance, references [3,4,5,6] gave a classification of arc-transitive graphs of order with valency 3, 5 and 7. Reference [7] showed that if a graph of order 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 . Here, we characterised the locally primitive arc-transitive graphs of order . There are many typical examples, including:
- (i)
- the complete graph ;
- (ii)
- the complete bipartite graph ;
- (iii)
- the graph obtained by deleting a 1-factor from ;
- (iv)
- the incidence graph and the nonincidence graph of the projective geometry , where and ;
- (v)
- the bidirect square of the incidence graph and the nonincidence graph of the -design; and
- (vi)
- the bidirect square of and , where .
This paper gives a classification of vertex quasiprimitive or bi-quasiprimitive locally primitive graph of order . The case when 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 with valency at least three, where 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 , or one of the following graphs:
- (1)
- , , ;
- (2)
- is Hoffman–Singleton graph, and ;
- (3)
- or , where and ;
- (4)
- the standard double cover of , where ; or
- (5)
- , a bidirect square of , where or , or with .
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 , the 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, , where 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 . Then, G is one of the eight types as follows:
- (1)
- N is abelian, and thus is regular on and , where p is a prime and ;
- (2)
- such that are nonabelian simple and regular on , and ;
- (3)
- such that with and T nonabelian simple, and ;
- (4)
- is a nonabelian simple group, and ;
- (5)
- with and T nonabelian simple, and for each ;
- (6)
- with and T nonabelian simple, and with and , where ;
- (7)
- N is nonabelia, non-simple and minimal normal in G acting regularly on ; and
- (8)
- 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 if r divides but not for . 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 has a primitive prime divisor, or or , where .
The next lemma can be easily obtained by Lemma 1.
Lemma 2.
Let 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 , then is a prime.
- (2)
- If , then .
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 with p a prime. Then, T, H and are as in Table 1.
Table 1.
Non-abelian simple group containing subgroups with index .
Remark 1.
, which is the parabolic subgroup of .
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 . Then, T and H are listed in Table 2. Further, either T is 2-transitive on or .
Table 2.
Non-abelian simple group containing subgroups with index .
A group X is called a generalized dihedral group, if there exists an abelian subgroup H and an involution such that and for each . This group is denoted by . 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 . Assume that G contains an abelian normal subgroup N that has exactly two orbits on . Then, is a bi-normal Cayley graph of the generalized dihegral group .
Let be a connected graph with vertex set , where or 2. Recall that the direct product is the graph with vertex set such that two vertices and are adjacent if and only if and are adjacent in for and 2. For convenience, we denote .
For a graph with vertex set V, the standard double cover is defined to be the graph with the vertex set and two vertices and are adjacent if and only if and and are adjacent in . It is easily shown that , a bipartite graph with biparts and . Clearly, the standard double cover of is .
Lemma 6
([14] Lemma 3.3). Let be a connected bipartite graph with biparts and . Assume that is transitive on E and intransitive on V such that and are conjugate in G, where and . Then, is the standard double cover of the orbital graph of G acting on . 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 is defined to be the graph with vertex set such that if and only if that both and in (where ∼ denotes adjacency). Clearly, is a connected component of .
3. Basic Graphs
In this section, let be a G-locally primitive and vertex-transitive graph of order , where 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 . Then, G is a permutation group of degree . Set , which is the product of all minimal normal subgroups of G. By Theorem 2, G is of type or .
We first give an example satisfying the main theorem.
Example 1.
Let and be a maximal subgroup of . By Magma, there exists an involution such that and . Define a coset graph . A calculation by Magma shows that , is -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 . Then, is 2-arc transitive, and is one of the following:
- (1)
- and or ;
- (2)
- is a Hoffman–Singleton graph, which is a 3-transitive non-Cayley graph.
Proof.
Note that G is quasiprimitive on and . Then
where . Thus, G is primitive if and only if T is primitive, and for some . Thus, the couple () is listed in Table 1.
For row 1, is primitive on , and T is -transitive on . Thus, it follows that is a complete graph. Since , is -arc transitive. Clearly, is -locally primitive arc-transitive.
For row 2, , and . Since is primitive on , the arc stabilizer is a maximal subgroup of the vertex stabilizer for each . Note that . Then, is a maximal subgroup of . Thus, . By Atlas [15], one knows that the possible value of is , 21 or . If , by Example 1, , which is a 3-transitive non-Cayley graph. If or 35, by Magma, , or . In these cases, one has that . Thus, is not connected. Therefore, there is no graphs in these cases.
For row 3, , and , which is a parabolic subgroup of T. Since is 2-transitive on with . Hence, with , and .
Finally, let and . Note that . By Lemma 2, n is a prime. Suppose that . Note that . It follows that and . Thus, and , and thus . Now, , a contradiction occurred. Suppose that . If , then and . Now, for any prime p, which is a contradiction. Assume that and . Let r be an odd prime divisor of . As , we have that .
Now, it follows that . Since , and have the same prime divisors, one has that . It follows that is a combinatorial factor of . As is a primitive permutation group, it concludes with Theorem 2 that is almost simple and . By checking the maximal subgroup of , we have that either or is a prime. Clearly, the former case is impossible. For the later case that is a Fermat prime, then for some positive integer f. Now, . By easy calculation, there exists no prime p satisfying .
Assume that . If , then , but . If , then by Lemma 1 has a primitive prime divisor, say r, and . Since and have the same prime divisors, we conclude that is a combinatorial factor of . Hence, the primitive permutation group is almost simple with socle . Thus, is a prime. It follows from Lemma 2 that is a prime, noting that n is a prime. Then, , which is a contradiction with the assumption. □
The following lemma considers the case that G is of type .
Lemma 8.
Suppose that G is a quasiprimitive permutation group of product action type on . Then, no graphs appear.
Proof.
By assumption, let . Then, N is not regular and also has no subgroup that is regular on . Further, there exists an almost simple group U with socle T satisfying that . If U is a permutation group on a set , then . For a vertex , then , it follows that , which is a contradiction with . □
3.2. Vertex-Biquasiprimitive Case
Suppose that acts biquasiprimitively on with biparts , . Then, and . Set . Then, . Clearly, is the normal subgroup of with index and quasiprimitive on and .
If acts unfaithfully on or , by reference [16] (Lemma 5.2), and . Suppose that acts faithfully on both and . By [9] (Theorem 2.2), quasiprimitive permutation groups of prime-power degree is primitive. Then, is primitive on both and . Thus, G is a biprimitive permutation group on . By Lemma 4 and Theorem 2, the following result is obtained.
Lemma 9.
Suppose that is faithful on both and . Then the actions of on are permutationally isomorphic, and one of the following holds:
- (1)
- is affine and ;
- (2)
- is almost simple and or with satisfying . In addition, is 2-transtive on , ;
- (3)
- is of product action type and , where , , , , or with satisfying .
The next lemma determines the graph according to the structure of .
Lemma 10.
Let be a G-locally primitive graph, and G be biquasiprimitive on with biparts and . Assume that is faithful on both and . Then, one of the followings holds:
- (1)
- is a bi-normal Cayley graph of the generalized dihedral group ;
- (2)
- , or with ;
- (3)
- is the standard double cover of , where ; and
- (4)
- , where , , or with .
Proof.
By Lemma 9, is a primitive permutation group of degree and is of type , or .
Assume that is of type . Then, , which is regular on . Since and , we have that . By Lemma 5, is stated as in ;
Assume that is of type . Let . Then, T is non-abelian simple and transitive on both and . Let be the centralizer of T in G. Then, . Suppose that . Since , it follows that , and thus , where g interchanges and . Clearly, C is semiregular and has orbits on . Now, the quotient graph induced by C is a -locally primitive arc-transitive graph of order . By [17] (Lemma 2.2), is the standard double cover of . By Lemma 9 (2), we know that is 2-transitive on . Thus, . It follows that .
Suppose that . Then, . Thus, G is an almost simple group. Assume that the induced permutations and are permutation equivalent. By Lemma 4, is 2-transitive on , so the orbital graph of acting on is . For and , because and are conjugate in G, by Lemma 6, is the standard double cover of . Thus, . Assuming that and are permutation inequivalent, by Lemma 4, and satisfy . As and are not conjugate in , we get or from [14] (Example 3.6).
Assume that the action of on is of type . By Lemma 9, , where T is stated as in of Lemma 9. Noting that is transitive on and , then the orbital graph of acting on is G-locally primitive arc transitive. Let . For a vertex , since is primitive, we have that is an orbit of on . By [14] (Lemma 2.4), , where is an orbit of H in and H is almost simple with socle T and primitive on satisfying that . It follows that . Since , , , , or with satisfying , which are 2-transitive on . We conclude that is a complete graph. That is .
Suppose that and are permutation equivalent. By Lemma 6, is the standard double cover of . Suppose that and are permutation inequivalent. By Lemma 9, , and or acts on 1-subspace or hyperplane of n-dimensional linear space over the field and satisfying that . Since is N-edge transitive, and are not conjugate in N, by [14] (Lemma 3.9), , is a bidirect product of , where , , , . □
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 , where p is an odd prime.
Assume that G is quasiprimitive on . By Lemmas 7 and 8, is the complete graph or the Hoffman–Singleton graph . Thus, the graphs in Theorem 1 (1), (2) hold.
Assume that G is biquasiprimitive on . Then, or the standard double cover of . By Lemma 10, either is a bi-normal Cayley graph on the generalized dihedral group , 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
- 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]
- 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]
- Zhou, J.X. Cubic vertex-transitive graphs of order 2p2. Adv. Math. 2008, 37, 605–609. [Google Scholar]
- Yu, H.X.; Zhou, J.X.; Wang, L.L. Cubic Cayley graph of order 2p2. Adv. Math. 2006, 35, 581–589. [Google Scholar]
- 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]
- Hua, X.H.; Chen, L. Valency seven symmetric graphs of order 2pq. Czechoslov. Math. J. 2018, 68, 581–599. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- Huppert, B. Endliche Gruppen I; Springer: Berlin/Heidelberg, Germany, 1967. [Google Scholar]
- 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]
- Guralnick, R.M. Subgroups of prime power index in a simple group. J. Algebra 1983, 81, 304–311. [Google Scholar] [CrossRef]
- Liu, H.L.; Lou, B.G. Pentavalent arc-transitive graphs of order 2p2q. Taiwan J. Math. 2018, 22, 767–777. [Google Scholar] [CrossRef]
- Li, C.H.; Ma, L. Locally primitive graphs and bidirect products of graphs. J. Aust. Math. Soc. 2011, 91, 231–242. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).