Pentavalent symmetric graphs of order four times an odd square-free integer
Bo Ling, Ben Gong Lou, and Ci Xuan Wu

TL;DR
This paper classifies all connected pentavalent symmetric graphs of order four times an odd square-free integer, identifying their automorphism groups or specific isomorphism types.
Contribution
It generalizes previous classifications by determining all such graphs for a broader class of orders, including explicit automorphism group structures.
Findings
Automorphism groups are isomorphic to PSL(2,p), PGL(2,p), or their products with Z_2.
Identifies 8 specific graphs with unique structures.
Provides a complete classification for the specified order class.
Abstract
A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of order . In this paper, we shall generalize this result by determining all connected pentavalent symmetric graphs of order four times an odd square-free integer. It is shown in this paper that, for each of such graphs , either the full automorphism group is isomorphic to , , or , or is isomorphic to one of 8 graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
Pentavalent symmetric graphs of order four times an odd square-free integer
Bo Linga,∗, Ben Gong Loub, and Ci Xuan Wuc
a: School of Mathematics and Computer Sciences
Yunnan Minzu University
Kunming, Yunnan 650504, P.R. China
b: School of Mathematics and Statistics
Yunnan University, Kunmin 650031, P. R. China
c: School of Statistics and Mathematics
Yunnan University of Finance and Economics
Kunming, Yunnan, P. R. China
Abstract.
A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, #P233, 2011) and Pan et al. (Electronic J. Combin. 20, #P36, 2013) determined all pentavalent symmetric graphs of order . In this paper, we shall generalize this result by determining all connected pentavalent symmetric graphs of order four times an odd square-free integer. It is shown in this paper that, for each of such graphs , either the full automorphism group is isomorphic to , , or , or is isomorphic to one of 8 graphs.
Keywords. Arc-transitive graph; Normal quotient; Automorphism group.
2000 MR Subject Classification 05C25, 05E18, 20B25.
This work was partially supported by the National Natural Science Foundation of China (11301468,11231008,11461004)
∗Corresponding author. E-mails: [email protected] (B. Ling).
1. Introduction
All graphs in this paper are assumed to be finite, simple, connected and undirected. Let be a graph and denote and the vertex set and arc set of , respectively. Let be a subgroup of the full automorphism group of . Then is called -vertex-transitive and -arc-transitive if is transitive on and , respectively. An arc-transitive graph is also called symmetric. It is well known that is -arc-transitive if and only if is transitive on and the stabilizer for some is transitive on the neighbor set of in .
The cubic and tetravalent graphs have been studied extensively in the literature. In recent years, attention has moved on to pentavalent symmetric graphs and a series of results have been obtained. For example, all the possibilities of vertex stabilizers of pentavalent symmetric graphs are determined in [7, 18]. Also, for distinct primes , and , the classifications of pentavalent symmetric graphs of order and are presented in [9, 17], respectively. A classification of -regular pentavalent graph (that is, the full automorphism group acts regularly on its arc set) of square-free order is presented in [13]. Recently, pentavalent symmetric graphs of square-free order have been completely classified in [11]. Furthermore, some classifications of pentavalent symmetric graphs of cube-free order also have been obtained in recent years. For example, the classifications of pentavalent symmetric graphs of order , and are presented in [8, 14, 5]. The main purpose of this paper is to extend the results in [8, 14] to four times an odd square-free integer case.
The main result of this paper is the following theorem.
Theorem 1.1**.**
Let be an odd square-free integer and let be a pentavalent symmetric graph of order . If has at least three prime factors, then one of the following statements holds.
- (1)
, , or , where is a prime.
- (2)
The triple lies in the following Table 1.
Remark 1.1.
- (a)
The graphs in Table 1 are introduced in Example 3.1.
- (b)
It seems not feasible to determine all the possible values of in part (1) for general odd square-free integer . However, if the number of the prime divisors of is fixed, then it is not difficult to determine the possible values of and hence all corresponding graphs .
2. Preliminaries
We now give some necessary preliminary results. The first one is a property of the Fitting subgroup, see [16, P. 30, Corollary].
Lemma 2.1**.**
Let be the Fitting subgroup of a group . If is soluble, then and the centralizer .
The maximal subgroups of are known, see [4, Section 239].
Lemma 2.2**.**
Let , where with a prime. Then a maximal subgroup of is isomorphic to one of the following groups, where .
- (1)
, where ; 2. (2)
, where ; 3. (3)
; 4. (4)
, where or ; 5. (5)
, where 6. (6)
, where , or with an odd prime; 7. (7)
* with an odd integer;* 8. (8)
* with an even integer.*
By [2, Theorem 2], we may easily derive the maximal subgroups of .
Lemma 2.3**.**
Let with a prime. Then a maximal subgroup of is isomorphic to one of the following groups:
- (1)
; 2. (2)
; 3. (3)
, where ; 4. (4)
, where ; 5. (5)
.
For a graph and a positive integer , an -arc of is a sequence of vertices such that are adjacent for and for . In particular, a -arc is just an arc. Then is called -arc-transitive with if is transitive on the set of -arcs of . A -arc-transitive graph is called -transitive if it is not -arc-transitive. In particular, a graph is simply called -transitive if it is -transitive.
Let denote the Frobenius group of order . The following lemma determines the stabilizers of pentavalent symmetric graphs, refer to [7, 18].
Lemma 2.4**.**
Let be a pentavalent -transitive graph, where and . Let . Then one of the following holds.
- (a)
If is soluble, then and |G_{\alpha}|\,\big{|}\,80. Further, the couple lies in the following table.
[TABLE]
- (b)
If is insoluble, then , and |G_{\alpha}|\,\big{|}\,2^{9}\cdot 3^{2}\cdot 5. Further, the couple lies in the following table.
[TABLE]
From [6, pp. 134-136], we can obtain the following lemma by checking the orders of nonabelian simple groups.
Lemma 2.5**.**
Let be an odd square-free integer such that has at least three prime factors. Let be a nonabelian simple group of order , where and . Let be the largest prime factor of . Then is listed Table 2.
*Proof. *If is a sporadic simple group, by [6, P. 135-136], , , , or . If is an alternating group, since does not divide , we have , it then easily exclude that , , or . Hence no exists for this case.
Suppose now is a simple group of Lie type, where is one type of Lie groups, and is a prime power. If , as has at most three 3-factors, two 5-factors and one -factor, it easily follows from [6, P. 135] that the only possibility is with (note that with does not satisfy the condition of the lemma) or , where is the largest prime factor of . If , as and do not divide , then we have , , , , or .
A typical method for studying vertex-transitive graphs is taking normal quotients. Let be a -vertex-transitive graph, where . Suppose that has a normal subgroup which is intransitive on . Let be the set of -orbits on . The normal quotient graph of induced by is defined as the graph with vertex set , and is adjacent to in if and only if there exist vertices and such that is adjacent to in . In particular, if , then is called a *normal cover * of .
A graph is called -locally primitive if, for each , the stabilizer acts primitively on . Obviously, a pentavalent symmetric graph is locally primitive. The following theorem gives a basic method for studying vertex-transitive locally primitive graphs, see [15, Theorem 4.1] and [12, Lemma 2.5].
Theorem 2.6**.**
Let be a -vertex-transitive locally primitive graph, where , and let have at least three orbits on . Then the following statements hold.
- (i)
* is semi-regular on , , and is a normal cover of ;*
- (ii)
, where and ;
- (iii)
* is -transitive if and only if is -transitive, where or .*
For reduction, we need some information of pentavalent symmetric graphs of order , stated in the following lemma, see [8, Theorem 4.1] and [14, Theorem 3.1].
Lemma 2.7**.**
Let be a pentavalent symmetric graph of order , where are primes. Then the couple lies in the following Table , where .
Remark 2.8.
- (a)
Suppose that is one of the graphs in Lemma 2.7 and is an arc-transitive subgroup of . Then is insoluble (for convenience, we prove this conclusion in Lemma 4.4 and we remark that Lemma 4.4 is independent where it is used).
- (b)
By Magma [1], the graphs and in [8, Theorem 4.1] are isomorphic, .
The final lemma of this section gives some information about the pentavalent symmetric graphs of square-free order, refer to [17, Theorem 1.1] and [11, Theorem 1.1].
Lemma 2.8**.**
Let be a pentavalent symmetric graph of order , where is an odd square-free integer and has at least three prime factors. Then one of the following statements holds.
- (1)
* is soluble and .*
- (2)
* or , where is a prime.*
- (3)
The triple lies in the following Table 4.
3. Some examples
In this section, we give some examples of pentavalent symmetric graphs of order with an odd square-free integer.
For a given small permutation group , we may determine all graphs which admit as an arc-transitive automorphism group by using Magma [1]. It is then easy to have the following result.
Example 3.1**.**
(1) There is a unique pentavalent symmetric graph of order which admits as an arc-transitive automorphism group; and its full automorphism group is . This graph is denoted by which satisfies the conditions in Row 6 of Table 1.
(2) There are five pentavalent symmetric graphs of order admitting as an arc-transitive automorphism group; and their full automorphism group are all isomorphic to . These five graphs are denoted by which satisfy the conditions in Row 1 to Row 5 of Table 1, where .
(3) There are two pentavalent symmetric graphs of order which admits as an arc-transitive automorphism group; and their full automorphism group are all isomorphic to . These two graphs are denoted by which satisfy the conditions in Row 7 to Row 8 of Table 1, where .
4. Proof of Theorem 1.1
Let be an odd square-free integer and has at least three prime factors. Let be a pentavalent symmetric graph of order . Set . By Lemma 2.4, |{\sf A}_{\alpha}|\,\big{|}\,2^{9}\cdot 3^{2}\cdot 5, and hence |{\sf A}|\,\big{|}\,2^{11}\cdot 3^{2}\cdot 5\cdot n. Assume that , where and are distinct primes.
We first consider the case where is soluble.
Lemma 4.1**.**
Assume that is soluble. Then no graph exists.
*Proof. *Let be the Fitting subgroup of . By Lemma 2.1, and . Further, , where , , ,, denote the largest normal -, -, -, , -subgroups of , respectively.
For each , has at least three orbits on , by Theorem 2.6, is semi-regular on . Therefore, is semi-regular on and . This argument also proves or . If or , then by Theorem 2.6, the normal quotient graph is a pentavalent symmetric graph of odd order, which is a contradiction. Thus, , , where m\,\big{|}\,2n. It implies that , and so .
If has at least three orbits on , then, by Theorem 2.6, is -arc-transitive. Since is abelian, we have , where , which is a contradiction.
Thus, has at most two orbits on . If is transitive on , then is regular on . It follows that is a normal arc-transitive Cayley graph of . Then we easily conclude that consists of the involutions of . Since has at most one involution, it follows that , which is a contradiction.
Hence has two orbits on and and . Since has orbits on , by Theorem 2.6(i), is an -arc-transitive pentavalent graph of order , and hence satisfies Lemma 2.7. Since is soluble, by Remark 2.8, a contradiction occurs.
We next consider the case where is insoluble.
Lemma 4.2**.**
Assume that is insoluble and has no nontrivial soluble normal subgroup. Then , or . Further, If , then which satisfy the conditions in Row 2 to Row 5 of Table 1 of Theorem 1.1, where .
*Proof. *Let be a minimal normal subgroup of . Then , where is a nonabelian simple group and .
If has more than three orbits on , then by Theorem 2.6, is semi-regular on and so divides . Since is a direct product of nonabelian groups, it implies that divides . Again by Theorem 2.6, is a pentavalent symmetric graph of odd order , a contradiction. Hence, has at most two orbits on , so divides .
Moreover, since , divides and does not divide as |{\sf A}|\,\big{|}\,2^{11}\cdot 3^{2}\cdot 5\cdot p_{1}p_{2}\cdots p_{s}, we conclude that and is a nonabelian simple group. Let . Then , and . If , then is insoluble as and has no soluble normal subgroup. It follows that divides . A similarly argument with the above paragraph, we have divides . Hence divides , and so divides . It implies that , a contradiction with having at least three prime factors. So and , that is, is almost simple with socle .
If , then acts regularly on . Hence is a non-abelian simple group such that . By checking the orders of nonabelian simple groups (see [6, P. 135-136] for example), we have that and so , which is impossible as is transitive on , and . Hence . Since is connected and , we have , it follows that 5\,\big{|}\,|S_{\alpha}|, we thus have divides .
Thus, is a nonabelian simple group such that |S|\,\big{|}\,2^{11}\cdot 3^{2}\cdot 5\cdot n and 10\cdot n\,\big{|}\,|S|. Hence the triple lies in Table 2 of Lemma 2.5. We will analyse all the candidates one by one in the following.
If with a prime, then or , the Lemma holds. If , then and as . It then follows from Example 3.1 that which satisfy the conditions in Row 1 to Row 5 of Table 1 of Theorem 1.1, where .
Assume . Since (see Atlas [3] for example), or , so or 6400, which is not possible by Lemma 2.4. Similarly, for the case , then or as . Thus, or 7680, which is impossible by Lemma 2.4. For the case where , since , where , we have , where , which is also impossible by Lemma 2.4. For the case where , since , where , we have , where , which is impossible by Lemma 2.4.
Assume . Since , we have , 1920 or 3840. If or , then by Lemma 2.4, or . However, by Atlas [3], has no subgroup isomorphic to and has no subgroup isomorphic to . If , then also by Lemma 2.4, a contradiction occurs.
Assume . Recall that has at most two orbits on , or . However, by Lemma 2.2, has no maximal subgroup with order a multiple of 240, a contradiction occurs. Similarly, for the case . Then or . By Atlas [3], has no maximal subgroup with order a multiple of 2880, a contradiction also occurs.
Assume . Then or , and as , we have and or . By Lemma 2.4, it is impossible for the case . For the latter case, by a direct computation using Magma [1], no graph exists. If , as , we have or , so or 960, a computation by Magma [1] shows that no graph exists. Similarly, we can exclude the case where by Magma [1].
Finally, assume or . Since , we always have . Hence or 10. A computation by Magma [1] also shows that no graph exists.
We next assume that has a nontrivial soluble normal subgroup. Let be a minimal soluble normal subgroup of . Then there exists a prime r\,\big{|}\,4n such that . Further, has at least three orbits on . It follows from Theorem 2.6 that is semi-regular on , and so |N|=|\mathbb{Z}_{r}|^{d}\,\big{|}\,|V{\it\Gamma}|=4n. If , then . It follows that is an arc-transitive graph of odd order, a contradiction. Hence , . The next lemma consider the case where .
Lemma 4.3**.**
Assume that is insoluble and has a minimal soluble normal subgroup . Then one of the following statements holds:
- (1)
* or , where is a prime.*
- (2)
* and is isomorphic to in Table 1, where .*
- (3)
* and is isomorphic to in Table 1.*
*Proof. *Since has more than three orbits on , then by Theorem 2.6, is an -arc-transitive pentavalent graph of order . It follows that is isomorphic to one of the graphs in Lemma 2.8. Since and is insoluble, we have that is insoluble and so , , or . Let .
Suppose that or . Since is insoluble, by Lemma 2.2 and Lemma 2.3, is isomorphic to , or . Since is transitive on , we can further conclude that is isomorphic to or . Therefore, or , that is, , , or . Assume first that . Note that has a unique central involution. Then by Lemma 2.4, . It follows that is divisible by 8 as is divisible by 8, a contradiction. Assume next that . Then contains a normal subgroup isomorphic to . Since 8\,\big{|}\,|H|, we have . By Theorem 2.6, has at most two orbits on and so \frac{|{\sf A}_{\alpha}|}{|H_{\alpha}|}\,\big{|}\,2. If is transitive on , then is arc-transitive. A similar argument with the case , a contradiction occurs. Therefore, has two orbits on and so . Since has a unique central involution, by Lemma 2.4, , it follows that is divisible by 16, a contradiction. Therefore, or in this case.
Suppose that . Since is -arc-transitive, we have that 5{\cdot}390\,\big{|}\,|{\sf A}/N|. By checking the maximal subgroup of (see Atlas [3] for example), we have that . It follows that or . If , then by Example 3.1, in Table 1, where . If , then by Magma [1], no graph exists.
Suppose that . Similarly, since is -arc-transitive, we have that 5{\cdot}2926\,\big{|}\,|{\sf A}/N|. By checking the maximal subgroup of (see Atlas [3] for example), we have that . Since the Schur multiplier of is , . By Example 3.1, in Table 1.
Finally, suppose that . We first prove the following lemma.
Lemma 4.4**.**
Assume that is isomorphic to one of the graphs listed in Lemma 2.7, in Lemma 4.2 and in Lemma 4.3. If is an arc-transitive subgroup of , then contains a subgroup isomorphic to , , or .
*Proof. *By checking the graphs in Lemma 2.7, in Lemma 4.2 and in Lemma 4.3, we have that is isomorphic to one of the groups , , , , , , or . If , then since p\,\big{|}\,n and 20n\,\big{|}\,|M|, by Lemma 2.2, or . If , then for some l\,\big{|}\,\frac{p-1}{2}. Thus, has a normal subgroup, say , which has more than three orbits on . It then follows from Theorem 2.6 that the normal quotient graph is -arc-transitive, a contradiction occurs as is cyclic. Hence, and so . If , then since 20n\,\big{|}\,|M|, by Lemma 2.3, , or . A similar argument, we can conclude that . Similarly, we can further show that for the case or .
If , then since is isomorphic to , we have that 5{\cdot}2926\,\big{|}\,|M|. By checking the maximal subgroup of (see Atlas [3]), we have that . We can further show that for the case , for the case and for the case .
Now assume that has a minimal soluble normal subgroup for .
Lemma 4.5**.**
Assume that has a minimal soluble normal subgroup for . Then the normal quotient is not isomorphic to any of the graphs listed in Lemma 4.4.
*Proof. *Suppose to the contrary that is isomorphic to one of the graphs in Lemma 4.4. Then by Theorem 2.6, is transitive on . Let . It follows from Lemma 4.4 that there exists a subgroup of isomorphic to one of the groups in . Since now , it follows from the structure of that . Therefore, , it implies that . On the other hand, since the order of the Schur multiplier of a group in is less than or equal to 2 (see [10, Theorem 7.1.1] for and Atlas [3] for the others) and , we have that and 4\,\big{|}\,|M^{\prime}|. If has more than three orbits on , then by Theorem 2.6, is a pentavalent symmetric graph of odd order, a contradiction. Thus, has at most two orbits on and so divides . Let , and . Then .
Assume first that . Then since |\bar{M}|\,\big{|}\,|\bar{\sf A}|\,\big{|}\,2^{11}{\cdot}3^{2}{\cdot}5{\cdot}\frac{n}{r} and is an odd square-free integer, we have that does not divide . It implies that has at least orbits on , a contradiction.
Assume next that . Since has at most two orbits on (if not is a pentavalent symmetric graph of odd order, a contradiction), we have that or , where . Now divides and or . It implies that divides . Therefore 3\,\big{|}\,|\bar{\sf A}_{\delta}|. By Lemma 2.4, is nonsolvable, because does not divide , forcing that is nonsolvable. If , then by Lemma 2.2, . Hence by Theorem 2.6 (ii). Note that , it contradicts that has no subgroup of order . If , then or in Table 1, where . If , then is soluble, a contradiction. If , then . A similar argument with the case leads to a contradiction. If , then in Table 3 and is soluble, a contradiction. If , then or in Table 1 and is soluble, also a contradiction.
Finally assume that . Then or as has at most two orbits on . Since is connected and , we have , it follows that 5\,\big{|}\,|M^{\prime}_{\alpha}|. On the other hand, since has at most two orbits on , we have that or . Note that and . Hence , it follows that 5^{2}\,\big{|}\,|\bar{M}_{\delta}|\,\big{|}\,|\bar{\sf A}_{\delta}|, a contradiction with |\bar{\sf A}_{\delta}|\,\big{|}\,2^{9}\cdot 3^{2}\cdot 5 by Lemma 2.4, a contradiction.
The final lemma completes the proof of Theorem 1.1.
Lemma 4.6**.**
Assume is insoluble. Then has no minimal soluble normal subgroup isomorphic to with .
*Proof. *Suppose that, on the contrary, has a minimal soluble normal subgroup with . We prove the lemma by induction on the order of .
Assume first that has three prime factors (Note that, by Table 3, the conclusion of Lemma 4.6 does not hold for ). Without loss of generality, we may assume that . Then is a pentavalent symmetric graph of order . By Lemma 2.7, is isomorphic to one of the graphs in Table 3, which contradicts to Lemma 4.5.
Assume next that has at least four prime factors. Note that is insoluble. If has no nontrivial soluble normal subgroup, then is isomorphic to one of the graphs in Lemma 4.2, which contradicts to Lemma 4.5. If has a minimal soluble normal subgroup , then we can also conclude that with a prime. If , then by induction, no such exists, a contradiction. If , then is isomorphic to one of the graphs in Lemma 4.3, which also contradicts to Lemma 4.5. This completes the proof of the lemma.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] W. Bosma, C. Cannon, C. Playoust, The MAGMA algebra system I: The user language, J. Symbolic Comput. 24 (1997), 235-265.
- 2[2] P.J. Cameron, G.R. Omidi, B. Tayfeh-Rezaie, 3-disigns from 𝖯𝖦𝖫 ( 2 , q ) 𝖯𝖦𝖫 2 𝑞 {\sf PGL}(2,q) , Electronic J. Combin. 13 (2006), 1-11.
- 3[3] J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, R.A. Wilson, Atlas of Finite Groups , Oxford Univ. Press, London/New York, 1985.
- 4[4] L.E. Dickson, Linear Groups and Expositions of the Galois Field Theory, Dover, 1958.
- 5[5] Y.Q. Feng, J.X. Zhou, Y.T. Li, Pentavalent symmetric graphs of order twice a prime power, Discrete Math. 336 (2016), 2640-2651.
- 6[6] D. Gorenstein, Finite Simple Groups , Plenum Press, New York, 1982.
- 7[7] S.T. Guo, Y.Q. Feng, A note on pentavalent s 𝑠 s -transitive graphs, Discrete Math. 312 (2012), 2214-2216.
- 8[8] S.T. Guo, J.X. Zhou, Y.Q. Feng, Pentavalent symmetric graphs of order 12 p 12 𝑝 12p , Electronic J. Combin. 18 (2011), #P 233.
