Abstract
A graph is edge-primitive if its automorphism group acts primitively on the edge set of the graph. Edge-primitive graphs form an important subclass of symmetric graphs. In this paper, edge-primitive graphs of order as a product of two distinct primes are completely determined. This depends on non-abelian simple groups with a subgroup of index pq being classified, where are odd primes.
MSC:
05E99; 08A99
1. Introduction
Throughout this paper, all graphs considered are assumed to be finite, connected and undirected. Let be a graph with vertex set and edge set . The size is called the order of the graph . Define an arc as a pair of ordered adjacent vertices, let be the set of the arcs of . Each edge corresponds to two arcs and .
Let be a graph. For an integer s ≥ 1, an s-arc in is an (s + 1)-tuple () of vertices such that , and for . A permutation of that preserves the adjacency of is called an automorphism of , and all automorphisms of form a group which is called the full automorphism group of , denoted by Aut. Let G be a subgroup of Aut, and denoted by Aut. Let Aut acting on vertex set , . We say that as the subgroup of G is a vertex-stabilizer if G is fixing the vertex . (Similarly, let . We may define the edge-stabilizer and arc-stabilizer of G, denoted by and , respectively). Moreover, the group Aut has a natural action on . Then, the graph is said to be G-edge-transitive if and for each pair of edges there exists some mapping one of these two edges to the other one. So, the graph is called G-vertex-transitive or G-arc-transitive if is transitive on or , respectively. A graph that is a G-arc-transitive graph for some is also known as a symmetric graph.
A graph is G-edge-primitive if acts primitively on , that is, if G preserves no nontrivial partition of the edge set. A G-edge-transitive graph is G-edge-primitive if some edge-stabilizer, the subgroup of its automorphism group which fixes a given edge, is a maximal subgroup of the automorphism [1]. Additionally, is called - if it is Aut-edge-primitive. In this paper, the original motivation was the problem of classifying all edge-primitive graphs of order as a product of two distinct primes. The study of edge-primitive graphs was initiated by R.M. Weiss. In 1973. Weiss [2] confirmed all edge-primitive graphs of valency 3. These graphs are the Heawood graph of order 14, the complete bipartite graph , the Levi graph and the Biggs–Smith cubic distance-transitive graph of order 102. Giudici and Li [3] systematically studied the O’Nan–Scott primitive types of the automorphism groups of edge-primitive graphs, and the G-edge-primitive graphs for G, an almost simple group with socle , are classified. We use soc to denote the socle of a group G, that is, the subgroup of G generated by all minimal normal subgroups of G. In case G is finite, the socle is the product of all minimal normal subgroups of G. A two dimensional projective group is denoted by . Li and Zhang [4] annalyzed edge-primitive s-arc-transitive graphs for . Guo et al. classified edge-primitive tetravalent and pentavalent graphs in [5] and [6]. Pan et al. discussed edge-primitive graphs of prime valency in [7], and edge-primitive Cayley graphs on abelian groups and dihedral groups in [8]. Lu [9] proved that a finite 2-arc-transitive edge-primitive graph has an almost simple automorphism group if it is neither a cycle nor a complete bipartite graph. Recently, Giudici and King [10] classified edge-primitive 3-arc-transitive graphs.
The work of studying edge-primitive graphs of specific orders is also attractive. Pan et al. studied all edge-primitive graphs of prime power order in [11], and edge-primitive graphs of order twice as a prime power in [12]. The main work of this paper is to classify all edge-primitive graphs of order as a product of two distinct primes.
In this paper, the notations used are standard [1]. For a positive integer n, we usually use and to denote the complete graph of order n and the complete bipartite graph of order , respectively. is defined as the cyclic group of order n, and as the dihedral group of order . As in Atlas [13], sometimes we simply use n to denote a cyclic group of order n. For the two groups K and H, we use and to denote the direct product of K and H and the semidirect product of K by H, respectively. The general linear group consists of all the matrices with entries in that have a non-zero determinant. The special linear group is the subgroup of all matrices of determinant 1. The projective general linear group and projective special linear group are the groups obtained from and on factoring by the scalar matrices contained in those groups. We use , , and to denote the projective special unitary group, the projective symplectic group, and the projective special orthogonal group, respectively. See [3] for details.
The classification of graph theory is closely related to the classification of group theory. The application of group theory in graph theory is mainly achieved through the role of groups on graphs. The symmetry of a graph is mainly described by the role of the automorphism group of the graph on each subgraph of the graph, such as the transitivity and primitivity of the automorphism group on the vertex set and edge set of the graph. The edge-primitive graph discussed in this paper is one of them. Specifically, the construction, characterization, and classification of various edge-primitive graphs with additional conditions have become some of the main issues discussed in algebraic graph theory. This paper completes the classification of specific orders in the edge-primitive graph, that is, edge-primitive graphs of order as a product of two distinct primes are completely determined.
The main result of this paper is shown as follows. Some of the graphs that appear in Theorem 1 will be explained in Section 2.
Theorem 1.
Let Γ be a G-edge-primitive graph of order , where , and are odd primes. Then, one of the following holds:
- (1)
- Γ is a star.
- (2)
- Γ, G are listed in Table 1, where for and , and is the stabilizer of α and e, respectively.Table 1. Edge-primitive graphs of order as a product of two distinct primes.
The layout of this paper is as follows. We collect some basic properties of edge-primitive graphs and some examples for edge-primitive graphs in Section 2. The most important theorem was proved in the last section.
2. Preliminary and Examples
The simplest examples of edge-primitive graphs are the stars K1,n, the cycles with prime numbers of vertices, and the complete graphs Kn. Following [3], we call an edge-primitive graph trivial if it is a star or a cycle. In this paper, non-trivial edge-primitive graphs are our main research object. We first collect some preliminary results of edge-primitive graphs for later use.
Lemma 1
([3], Lemma 3.4). Let Γ be a non-trivial G-edge-primitive graph for some . Then, Γ is G-arc-transitive.
Arc transitive graphs can be represented using the group theory method of constructing a coset graph. Let G be a finite group, and let . We say that the set is the right coset of H in G if . For an element with , , we say that Cos is a coset graph of G with respect to H and g if and are adjacent if and only if . The graph is connected if and only if . Let be the vertex H of the coset graph. Moreover, the valency of is , and the stabilizer of the edge is . See [3] for details.
Let , denote by , , and as the vertex-stabilizer, edge-stabilizer, and arc-stabilizer of G, respectively.
Lemma 2
([12], Lemma 2.5). Let Γ be a graph, , and . Then, the following statements hold.
- (1)
- If Γ is G-edge-primitive, then . In particular, .
- (2)
- If Γ is G-arc-transitive, then .
- (3)
- If Γ is G-edge-transitive but not G-arc-transitive, then .
The valency of a regular graph is denoted by val.
Lemma 3.
Let Γ be a nontrivial G-edge-primitive graph and . Then .
Proof.
It can be easily concluded that is non-trivial, val, and is G-arc-transitive, so . □
We define a transitive permutation group as quasiprimitive if every minimal normal subgroup of G is transitive on . Moreover, we say that the group G is biquasiprimitive if each of its minimal normal subgroups has at most two orbits, and there is a minimal normal subgroup with exactly two orbits on it.
Let be a G-edge-primitive graph with , and let N be a nontrivial normal subgroup of G. If N is transitive on edges, then is either transitive on vertices or is bipartite and N has two orbits on the vertex set. This simple observation leads to the following assertion.
Lemma 4.
Let Γ be a non-trivial G-edge-primitive graph with . Then, G is either quasiprimitive or biquasiprimitive on .
Therefore, we need some relevant information for (quasi)primitive permutation groups. Let G be a quasiprimitive group. Utilizing the structure and the action of soc, the quasiprimitive permutation group is divided into eight types by O’Nan–Scott–Praeger theorem, namely HA, HS, HC, AS, SD, CD, PA, and TW. See Praeger [14] for details. As an application of the O’Nan–Scott-Praeger theorem, it is straightforward to obtain the following results.
Lemma 5.
Let G be a quasiprimitive permutation group of degree , where are odd primes. Then, G is an almost simple group.
By Theorem 2.1 of [3], Giudici and Li have classified the groups which act edge-primitively on a complete graph.
Lemma 6
([8], Lemma 2.4). Let G be an almost simple group with soc and . Then, the action of G on a complete graph is not edge-primitive.
To construct edge-primitive graphs, the most important results are as follows:
Proposition 1
([3], Proposition 2.5). Let G be a finite group with a maximal subgroup E. Then, there exists a G-edge-primitive, arc-transitive graph Γ with an edge stabiliser E if and only if E has a subgroup A and . In addition, G have a core-free subgroup H such that . In this case, for some .
Example 1.
Let Γ = Kpq, where are odd primes. Then, = contains a subgroup . This subgroup G has a maximal subgroup , and E has a subgroup of index two. The group G also contains a maximal subgroup isomorphic to , and H contains the subgroup A. So, the graph Γ is G-vertex-primitive, and by Proposition 1, the graph Γ is also G-edge-primitive.
Example 2.
Let . According to Atlas [13], has two maximal subgroups and such that . Define a coset graph
By Proposition 1, is an T-edge-primitive graph, with valency , and . Based on the calculation of the Magma [15], it can be concluded that any T-arc-transitive graph with vertex stabilizer and valency 77 is isomorphic to and has the automorphism group . So, is G-edge-primitive with .
Example 3.
Let . Then, following Proposition 8.4 of [3], T has a subgroup and a maximal subgroup of one conjugate class such that . Define a coset graph
By Proposition 1, this graph is T-edge-primitive, with valency and . Furthermore, after calculation in Magma [15], it can be concluded that any T-arc-transitive graph with vertex stabilizer and valency 57 is isomorphic to , and has automorphism group . So is G-edge-primitive with .
Example 4.
Let . Then, from Proposition 8.4 of [3], T has a subgroup and of a maximal subgroup of one conjugate class such that . Define a coset graph
By Proposition 1, this graph is T-edge-primitive, with valency and . Furthermore, a computation by Magma [15] shows that any T-arc-transitive graph with vertex stabilizer and valency 65 is isomorphic to , and has automorphism group . So, is G-edge-primitive with .
3. Proof of Theorem 1
Let be a non-trivial G-edge-primitive graph for some . Further assume that the order of this graph is , where are odd primes. By Lemmas 1 and 4, is G-arc-transitive and G is either quasiprimitive or biquasiprimitive on .
Therefore, we need to consider two types of cases when G is quasiprimitve on . By Lemma 5, G can only be an almost simple group. Thus, soc is non-abelian simple and transitive on , so . Non-abelian simple groups with a subgroup of index have been classified in [16] (Theorem 1.1) (see also [17] [THEOREM]). The result can be read off as follows.
Lemma 7.
Let T be a non-abelian simple group with a subgroup H of index , where are odd primes. Then, the tuple is listed in Table 2, where is the stabilizer of the classical group acting naturally on the 1-subspaces.
Table 2.
Non-abelian simple groups with a subgroups of index .
Lemma 8.
Assume that G is an almost simple quasiprimitive group on . Then, Γ and G are listed in Table 1 in Theorem 1.
Proof.
Based on the assumption, , where and . Hence, the tuple (as there) is listed in Table 2. We analyze each candidate in the following.
Row 1. In this case, , , and . Hence, or , and or 8, respectively. By Lemma 3, or 8. However, by the Atlas [13], or have no such maximal subgroup . So, is not edge-primitive in this case.
Row 2. In this case, , if , and , where . Then, by [1] (p. 308, TABLE B.2), T is of rank 2 on , so one non-trivial suborbit is of lengths 14. Hence, is T-arc-transitive of valency 14. Assume val, then and , so . However, by the Atlas [13], there is no maximum subgroup of order in group , which is a contradiction. If , , then by Lemma 3, . However, by the Atlas [13], has no such maximal subgroup , which is a contradiction.
Row 3. Assume that , if , and , where . By [1] (p. 308, TABLE B.2), T is of rank 2 on , so one non-trivial suborbit is of lengths 14. Then, is T-arc-transitive of valency 14. Assume val, then and , so . However, by the Atlas [13], there is no maximum subgroup of order in group , which is a contradiction. If , , and by Lemma 3, . By the Atlas [13], or , then or 720. However, a computation by Magma [15] shows that has no subgroup with order 360 or 720, a contradiction.
Row 4. Assume that , , and . By Lemma 3, . By the Atlas [13], or , then or 48. However, according to the calculation in Magma [15], it can be concluded that has no subgroup with order 120 or 48, which is a contradiction.
Row 5. In this case, T is primitive on , , and , where . By [1] (p. 321, TABLE B.2), T is of rank 3 on , and it is easy to compute out that the lengths of its two non-trivial suborbits are 16 and 60. So, is T-arc-transitive of valency 16 and 60. If val, by Example 2, . If val, then , and by Lemma 6, , hence, . However, by the Atlas [13], all maximal subgroups of T and are of order at least 660, which is a contradiction.
Row 6. In this case, , if , , and , . By Lemma 3, . By the Atlas [13], we can see that there are five possibilities for , , , , , . Note that only the case contains an index two subgroup , hence . However, from Magma [15], has no subgroup with order 2880, which is a contradiction. Similarly, for the case , we also get a contradiction.
Row 7–13. By [3] (Theorem 1.3), since , and are odd primes. Now, a direct computation can determine all the possibilities of . If , by Example 3, . If , by Example 4, .
Row 14. In this case, , , and , where . Using the calculations in Magma [15], it can be concluded that T is of rank 3 on , with two non-trivial suborbits of lengths 42 or 112. Hence, val or 112, and is T-arc-transitive. If val , then , by Lemma 2, . However, by the Atlas [13], there is no maximum subgroup of order in group , which is a contradiction. If val , then , and . By the Atlas [13], there is no maximum subgroup of order in group , which is a contradiction.
Row 15. If , , and , where . According to the calculation in Magma [15], it can be concluded that T is of rank 3 on , with two non-trivial suborbits of lengths 54 or 64. Hence, val or 64, and is T-arc-transitive. If val , then , and . However, by Atlas [13], there is no maximum subgroup of order in group , which is a contradiction. If val , then , and . However, by the Atlas [13], there is no maximum subgroup of order in group , which is a contradiction.
Row 16. In this case, , , and , where . From Magma [15], a simple computation can determine that the rank of T on is 3, with two non-trivial suborbits of lengths 256 or 270. Hence, val or 270, and is T-arc-transitive. If val , then , and . However, by Atlas [13], has no maximal subgroup with order , which is a contradiction. Similarly, if val , then , . By the Atlas [13], there is no maximum subgroup of order in group , which is a contradiction.
Row 17. In this case, is 2-transitive on the set of right cosets of , where , so and . Hence, , and is maximal in T, so is G-edge-primitive with and .
Row 18–19. Assume that , , and , where . According to the calculation in Magma [15], it can be concluded that T is of rank 3 on , with two non-trivial suborbits of lengths or . Hence, val or , and is T-arc-transitive. If val , then , and , By [18] (Theorem 1.1), there exists no subgroup , which is a maximal subgroup of , such that has a subgroup of index two. Thus, there is no G-edge-primitive graph arising in this case. If val . Similarly, . By [18] (Theorem 1.1), there is no G-edge-primitive graph. Assume that , similar to the discussion above, or , by [18] (Theorem 1.1), there is no G-edge-primitive graph occurring in this case.
Row 20. Then, , . By [3] (Theorem 1.3), no graph exists in this case.
Row 21. Then, is 2-transitive on where , so is a complete graph, contradicting Lemma 6.
Row 22. In this case, , + + , and with . From Magma [15], it can be concluded that T is of rank 3 on , with two non-trivial suborbits of lengths + or . Hence, val + , and , and is T-arc-transitive. If val + , then , and , so . Therefore, by [19] (Tables 8.12–8.15), has no maximal subgroup with order , which is a contradiction. If val . Similarly, . By [19] (Tables 8.12–8.15), T has a maximal subgroup with order . However, , so is an even number, again a contradiction.
Row 23. In this case, , + + , and with . From Magma [15], a simple computation can determine that the rank of T on is 2, with one non-trivial suborbit of lengths . Hence, val and is T-arc-transitive. If val , then , and , so . However, by [19] (Table 8.5–8.6), has no maximal subgroup with order , which is a contradiction.
Row 24. In this case, , + − , and with . According to the calculation in Magma [15], it can be concluded that T is of rank 3 on , with two non-trivial suborbits are of lengths and . Hence, val , and , and is T-arc-transitive. If val , then , and , so . However, by [19], has no maximal subgroup with order , which is a contradiction. If val. Similarly, . However, by [19], has no maximal subgroup with order , which is a contradiction.
Row 25. In this last case, , − , and with . After the calculation in Magma [15], it can be concluded that T is of rank 3 on , with two non-trivial suborbits of lengths or . Hence, val and , and is T-arc-transitive. If val , then , and , so . However, by [19], has no maximal subgroup with order , which is a contradiction. If val . Similarly, . However, by [19], has no maximal subgroup with order , which is a contradiction. □
Now, we are ready to complete the proof of Theorem 1.
Proof
(Proof of Theorem 1). Suppose that the is a G-edge-primitive with order , where , and are odd primes. Let be a G-edge-primitive graph of order , where , and are odd primes. Suppose is not a star. By Lemma 4, G is quasiprimitive or biquasiprimitive on .
Firstly, suppose that G is quasiprimitive on , by Lemma 8, and , G, s are listed in Table 1 in Theorem 1.
Secondly, suppose that G is biquasiprimitive on , then G has biparts and with , so . However, as are odd primes, this is impossible.
This completes the proof of Theorem 1. □
4. Conclusions
Currently, the construction, classification, and characterization of various edge-primitive graphs with additional conditions have become some of the main issues discussed in algebraic graph theory. In this paper, edge-primitive graphs of order as a product of two distinct primes are completely determined. This depends on non-abelian simple groups with a subgroup of index pq being classified, where are odd primes. It is meaningful for future research to classify edge-primitive graphs of other specific orders or degrees.
Author Contributions
Writing—original draft, R.X.; Writing—review & editing, X.Z. and H.Z. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the National Natural Science Foundation of China under Grant No. 11564078, the Science and Technology Key Project of Jiangxi Provincial Education Department under grant No. GJJ202602, the Jiangxi Provincial Natural Science Foundation under Grants No. 20161BAB212032, 20232BAB202034, the Natural Science Research Project of Nanchang Normal University under grant No. 23XJZR01.
Data Availability Statement
Not applicable.
Acknowledgments
The authors would like to thank the anonymous referees for many comments and constructive suggestions.
Conflicts of Interest
The authors declare no conflict of interest. The funders had no role in the design of the study; in the writing of the manuscript, or in the decision to publish the results.
References
- Dixon, J.D.; Mortimer, B. Permutation Groups; Springer: New York, NY, USA, 1996. [Google Scholar]
- Weiss, R.M. Kantenprimitive Graphen vom Grad drei. J. Combin. Theory Ser. B 1973, 15, 269–288. [Google Scholar] [CrossRef] [Scilit]
- Giudici, M.; Li, C.H. On finite edge-primitive and edge-quasiprimitive graphs. J. Combin. Theory Ser. B 2010, 100, 275–298. [Google Scholar] [CrossRef] [Scilit]
- Li, C.H.; Zhang, H. The finite primitive groups with soluble stabilizers, and the edge-primitive s-arc transitive graphs. Proc. Lond. Math. Soc. 2021, 103, 441–472. [Google Scholar] [CrossRef] [Scilit]
- Guo, S.T.; Feng, Y.Q.; Li, C.H. The finite edge-primitive pentavalent graphs. J. Algebr. Comb. 2013, 38, 491–497. [Google Scholar] [CrossRef] [Scilit]
- Guo, S.T.; Feng, Y.Q.; Li, C.H. Edge-primitive tetravalent graphs. J. Combin. Theory Ser. B 2015, 38, 124–137. [Google Scholar] [CrossRef] [Scilit]
- Pan, J.M.; Wu, C.X.; Yin, F.G. Finite edge-primitive graphs of prime valency. Eur. J. Combin. 2018, 38, 61–71. [Google Scholar] [CrossRef] [Scilit]
- Pan, J.M.; Wu, C.X.; Yin, F.G. Edge-primitive Cayley graphs on ablian groups and dihedral groups. Discret. Math. 2018, 38, 3394–3401. [Google Scholar] [CrossRef] [Scilit]
- Lu, Z.P. On edge-primitive 2-arc-transitive graphs. J. Combin. Theory Ser. A 2020, 38, 105172. [Google Scholar] [CrossRef] [Scilit]
- Giudici, M.; King, C.S.H. On edge-primitive 3-arc-transitive graphs. J. Combin. Theory Ser. B 2021, 38, 282–306. [Google Scholar] [CrossRef] [Scilit]
- Pan, J.M.; Huang, X.H.; Wu, C.X. Edge-primitive graphs of prime power order. Graphs Combin. 2019, 38, 249–259. [Google Scholar] [CrossRef] [Scilit]
- Pan, J.M.; Wu, C.X. On edge-primitive graphs of order twice a prime power. Discret. Math. 2019, 38, 11594. [Google Scholar] [CrossRef] [Scilit]
- Conway, J.H.; Curtis, 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]
- 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 1992, 38, 227–239. [Google Scholar] [CrossRef] [Scilit]
- Bosma, W.; Cannon, J.; Playoust, C. The MAGMA algebra system I: The user language. Symbolic Comput. 1997, 38, 235–265. [Google Scholar] [CrossRef] [Scilit]
- Li, C.H.; Li, X.H. On permutation groups of degree a product of two prime-powers. Comm. Algebra 2014, 42, 4722–4743. [Google Scholar] [CrossRef] [Scilit]
- Praeger, C.E.; Xu, M.Y. Vertex-primitive graphs of order a product of two distinct primes. J. Combin. Theory Ser. B 1993, 59, 245–266. [Google Scholar] [CrossRef] [Scilit]
- Zhang, H.; Zhou, S.M. Finite edge-primitive graphs admitting an alternating group. 2023, submitted. 2023; submitted.
- Bray, J.N.; Holt, D.F.; Roney-Dougal, C.M. The Maximal Subgroups of the Low-Dimensional Finite Classical Groups; Cambrige University Press: New York, NY, USA, 2013. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 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/).