Loading [MathJax]/jax/output/SVG/jax.js
Research article

Orientable vertex imprimitive complete maps

  • Received: 22 January 2024 Revised: 03 March 2024 Accepted: 14 March 2024 Published: 26 March 2024
  • In the work by Li (J. Combin. Theory Ser. B, 99 (2009), 447–454.), the author characterized the classification of vertex transitive embeddings of complete graphs, and proposed how to enumerate such maps. In this paper, we study the counting problem of orientable vertex imprimitive complete maps, which is the automorphism group of this map acts imprimitively on its vertex set. Moreover, we obtain the number of non-isomorphic embeddings when the vertex-stabilizer subgroups of the automorphism groups of maps are isomorphic to Zp1 with odd prime p.

    Citation: Xue Yu. Orientable vertex imprimitive complete maps[J]. Electronic Research Archive, 2024, 32(4): 2466-2477. doi: 10.3934/era.2024113

    Related Papers:

    [1] Huani Li, Xuanlong Ma . Finite groups whose coprime graphs are AT-free. Electronic Research Archive, 2024, 32(11): 6443-6449. doi: 10.3934/era.2024300
    [2] Xiaoyan Xu, Xiaohua Xu, Jin Chen, Shixun Lin . On forbidden subgraphs of main supergraphs of groups. Electronic Research Archive, 2024, 32(8): 4845-4857. doi: 10.3934/era.2024222
    [3] Hongyan Guo . Automorphism group and twisted modules of the twisted Heisenberg-Virasoro vertex operator algebra. Electronic Research Archive, 2021, 29(4): 2673-2685. doi: 10.3934/era.2021008
    [4] Qiang Mu . Smash product construction of modular lattice vertex algebras. Electronic Research Archive, 2022, 30(1): 204-220. doi: 10.3934/era.2022011
    [5] Jiangsheng Hu, Dongdong Zhang, Tiwei Zhao, Panyue Zhou . Balance of complete cohomology in extriangulated categories. Electronic Research Archive, 2021, 29(5): 3341-3359. doi: 10.3934/era.2021042
    [6] Víctor León, Bruno Scárdua . A geometric-analytic study of linear differential equations of order two. Electronic Research Archive, 2021, 29(2): 2101-2127. doi: 10.3934/era.2020107
    [7] Fei Ma, Min Yin, Yanhui Teng, Ganglian Ren . Nonlinear generalized semi-Jordan triple derivable mappings on completely distributive commutative subspace lattice algebras. Electronic Research Archive, 2023, 31(8): 4807-4817. doi: 10.3934/era.2023246
    [8] Wen Teng, Xiansheng Dai . Nonabelian embedding tensors on 3-Lie algebras and 3-Leibniz-Lie algebras. Electronic Research Archive, 2025, 33(3): 1367-1383. doi: 10.3934/era.2025063
    [9] Agustín Moreno Cañadas, Pedro Fernando Fernández Espinosa, José Gregorio Rodríguez-Nieto, Odette M Mendez, Ricardo Hugo Arteaga-Bastidas . Extended Brauer analysis of some Dynkin and Euclidean diagrams. Electronic Research Archive, 2024, 32(10): 5752-5782. doi: 10.3934/era.2024266
    [10] Chuang Ma, Helong Xia . A one-step graph clustering method on heterogeneous graphs via variational graph embedding. Electronic Research Archive, 2024, 32(4): 2772-2788. doi: 10.3934/era.2024125
  • In the work by Li (J. Combin. Theory Ser. B, 99 (2009), 447–454.), the author characterized the classification of vertex transitive embeddings of complete graphs, and proposed how to enumerate such maps. In this paper, we study the counting problem of orientable vertex imprimitive complete maps, which is the automorphism group of this map acts imprimitively on its vertex set. Moreover, we obtain the number of non-isomorphic embeddings when the vertex-stabilizer subgroups of the automorphism groups of maps are isomorphic to Zp1 with odd prime p.



    If a graph can be embedded in a surface, then naturally there will be a problem: How many non-isomorphic ways can it be done? One of the main aims of topological graph theory is to enumerate all the symmetrical embeddings of a given class of graphs in closed surfaces, see [1,2,3]. As one of a series of papers toward solving the problem of counting the number vertex transitive embeddings of complete graphs, we restrict our attention here to the orientable vertex imprimitive embeddings of complete graphs.

    Let M=(V,E,F) be an orientable map with vertex set V, edge set E, and face set F, that is, M is a 2-cell embedding of the finite underlying graph Γ=(V,E) in an orientable surface. For convenience, a map M is called a complete map if its underlying graph is a complete graph.

    An automorphism of a map M is a permutation of VEF, which preserves V, E, F, and their incidence relations, so it is exactly an automorphism of the underlying graph which preserves the supporting surface. All automorphisms of M form the automorphism group Aut(M) under composition.

    A map M is said to be G-vertex-imprimitive (or a vertex-imprimitive embedding of its underlying graph) if G=Aut(M) acts imprimitively (but transitively) on the vertex set V. Furthermore, if G also preserves the orientation of the supporting surface, then M is called orientable vertex-imprimitive. Here, a permutation group G acting transitively on a set Ω is imprimitive, which means that G preserves a nontrivial partition of Ω.

    Recent development concerning the theory of maps was closely related to the theory of map colorings, with the topic of highly 'symmetrical' maps always at the center of interest, and recent investigation began with Biggs [4,5]. In the past fifty years, plenty of results about 'symmetrical' maps have been obtained, see [2,6,7] and the references therein. In particular, see [2,3,5] for arc transitive complete maps, see [8,9,10] for vertex transitive complete maps, and see [11,12] for edge transitive complete maps. Very recently, some special families of edge-transitive embeddings of complete bipartite graphs are classified in [13,14,15,16,17,18]. Additionally, the Cayley map of the quaternion group Q8 constructed in [19, Figure 7] is a complete 4-partite map with arcs colored i, j, k; the map constructed has the property that removing the arcs colored i creates an imprimitive map whose automorphism group action preserves the partition of the edges into those colored j and those colored k. For more information about the embeddings of complete graphs, see [20,21,22].

    The purpose of this paper is to enumerate the number of orientable vertex imprimitive maps with underlying graphs being complete graphs. Recall that ϕ(n) is the Euler phi-function, i.e. the number of positive integers which is less than and co-prime to n, where n is a positive integer. The main result of this paper is now stated as follows.

    Theorem 1.1. Let M be an orientable, vertex imprimitive, complete map with automorphism group G=Aut(M), and let Gα be the stabilizer of a vertex α of M. Then M is a Cayley map of Zdp for some integer d2 and odd prime p. In addition, the group GZdp:Gα is a Frobenius group whenever Gα is a cyclic group. Furthermore, if GαZp1 acting on the neighborhood of α has λ orbits with λ(p1)=pd1 and λ4 is a prime, then the number of non-isomorphic orientable vertex imprimitive complete maps equals

    |Aλ||A1||SL(d,p)|,

    where |Aλ|=(λ1)!(p1)λ1ϕ(p1) and |A1|=ϕ(pd1).

    As a by-product of the Theorem 1.1, we can deduce the following conclusions when λ is a composite integer.

    Corollary 1.2. Let p1 and p2 be two different primes.

    (i) If λ=p1p2, then the number of non-isomorphic orientable vertex imprimitive complete maps equals |Ap1p2||Ap1||Ap2|+|A1||SL(d,p)|.

    (ii) If λ=p21p2, then the number of non-isomorphic orientable vertex imprimitive complete maps equals |Ap21p2||Ap1p2||Ap21|+|Ap1||SL(d,p)|.

    This paper is organized as follows. After this introductory section, some preliminary results are given in Section 2, then the enumeration of different and non-isomorphic orientable vertex imprimitive complete maps is given in Sections 3 and 4, respectively. Finally, we give the complete proof of Theorem 1.1 in Section 5.

    In this section, we need some notations for convenience and give some results that will be used in the following discussion.

    Let p be an odd prime and let d2 be an integer. The elementary abelian p-group of order pd will be denoted by Zdp. We use o(a) and a to denote the order of a and the group generated by a, respectively. We use Zp1 and D2p to denote the cyclic group of order p1 and the dihedral group of order 2p, respectively. The general linear group and the special linear group of the field Fpd are denoted by GL(d,p) and SL(d,p), respectively. The centralizer and the normalizer of Zp1 in GL(d,p) are denoted by CGL(d,p)(Zp1) and NGL(d,p)(Zp1), respectively. Let H and K be two groups. Then we use H:K to denote a semi-direct product of H by K, in which H is a normal subgroup. We use Z(H), Aut(H), and Inn(H) to denote the center, the automorphism group, and the inner automorphism group of H, respectively.

    Let F=Fpd be the field of order pd. Let F+=F+pd and F×=F×pd be the additive group and the multiplicative group of F, respectively. It follows that

    F+Zdp,F×Zpd1.

    Let 0 be the identity of the F+. Let F# be the set of all nonidentity elements of F+, namely, F#=F+{0}. Then the complete graph Kpd may be represented as a Cayley graph

    Kpd=Cay(F+,F#).

    A Cayley map M is an embedding of a Cayley graph Σ=Cay(H,S) into a surface, such that Aut(M) contains a subgroup N acting regularly on the vertices and M is called a Cayley map of N (or a Cayley embedding of Σ with respect to N). Moreover, Cayley maps form a very interesting family of vertex-transitive maps [6,9].

    For a vertex v, a cyclic permutation of the neighbour set Γ(v) of v is called a rotation at v and denoted by Rv. A rotation system R(Γ) of a graph Γ is the set of rotations at all vertices, that is, R(Γ)={Rv}vV. Hence, each rotation system R(Γ) defines an orientable embedding of Γ, refer to [23, pp.104–108].

    Noting that the vertex rotations Rv can be regarded as permutations not only of the set Γ(v) but also of the generating set S, the Cayley maps have another equivalent definition [24]. A map with an underlying graph being Cayley graph Σ=Cay(H,S) is a Cayley map if the induced local cyclic permutations of S are all the same. Moreover, each cyclic permutation ρ of F# gives rise to a unique orientable Cayley embedding of Kpd with the underlying graph Γ=Cay(F+,F#). Thus, if two cyclic permutations ρ1 and ρ2 of F# are different, then the orientable vertex imprimitive complete maps generated by them are also considered to be different.

    In this section, we determine enumeration of different vertex imprimitive embeddings of a complete graph. Now, we begin by citing the well-known conclusion about vertex transitive maps.

    Lemma 3.1. ([8, Lemma 2.2]) Let M be a vertex-transitive map and let G=Aut(M). Then the stabilizer GαZk or D2k for a vertex α, and each orbit of Gα acting on the neighborhood of α has length k.

    Next, from [8, Theorem 1.1] and [23, Lemma 5.4.1], we can directly obtain the following lemma.

    Lemma 3.2. Let M be an orientable vertex imprimitive complete map. Let G=Aut(M). Then M is a Cayley map of Zdp, GZdp:Zk is a Frobenius group, and GαZk such that (k,p)=1.

    Assume that Gα:=a with o(a)2. Then GF+:a is a Frobenius group by Lemma 3.2. It follows that a is half-transitive on F+, and |a|=k is a divisor of |F+|1=pd1. Specially, if |a|=p1, thus, Gα acting on Γ(α) has λ orbits with λ=(pd1)/(p1)4, then we get the lemma as follows.

    Lemma 3.3. If GF+:Zp1, then there are exactly (λ1)!(p1)λ1ϕ(p1) different orientable vertex imprimitive complete maps.

    Proof. Taking α=0 for convenience with 0 the identity element of F+. It follows that G0 partitions the neighborhood Γ(0) of 0 into λ orbits with λ4, and the length of each orbit is p1 in view of Lemma 3.1. Since F# is the set of all nonidentity elements of F+, then |F#|=pd1, and, further, we have

    F#=Δ1˙Δ2˙˙Δλ,

    where Δi is an orbit of G0 acting on Γ(0), and |Δi|=p1 with 1iλ.

    Note that the vertex 0 and the neighbors can be lied on a disc such that 0 is in the center and the neighbors of 0 are around 0. Without loss of generality, we may assume that the pd1 neighbors of 0 (i.e. all the elements of F#) are in clockwise order around 0 and denoted by β1,β2,,βpd1, then

    ρ:=(β1,β2,,βpd1)

    is a cyclic permutation of F#. Further, we can obtain that the number of the cyclic permutations of F# equals the number of arrangements of βi, and it follows that to determine the number of the orientable vertex imprimitive complete maps, we only need to determine the different choices of βi with 1ipd1.

    Set β1=1 and β1Δ1 for convenience, where 1 is the identity element of F×. If β2Δ1, then 1al=β2 for some al, where 0<lp2. It follows that al:β2β3β41. Thus, (l,p1)=1 and G0=al acting on Γ(0) has only one orbit, which is a contradiction, so β2Δ1 and β2Δi with 2iλ. Without loss of generality, set β2Δ2 for convenience, then β2 has (λ1)(p1) different choices.

    If β3Δ2, then βaj2=β3 for some aj, where 0<jp2. Furthermore, there is aj:β2β3β41. It follows that (j,p1)=1, β1Δ2 and G0 acting on Γ(0) has only one orbit, which is a contradiction. Thus, β3Δ2.

    If β3Δ1, then 1aj=β3 for some aj, where 0<jp2. It follows that there are aj:1β3β51 and aj:β2β4β6β2. Thus, G0=aj acting on Γ(0) has two orbits, which is a contradiction. It follows that β3Δ1 and β3Δi with 3iλ. Without loss of generality, set β3Δ3 for convenience, so β3 has (λ2)(p1) different choices.

    If β4Δ3, then βat3=β4 for some at, where 0<tp2. Moreover, there has at:β3β4β51. Thus, (t,p1)=1, 1Δ3 and G0=at acting on Γ(0) has only one orbit, which is a contradiction. so β4Δ3.

    If β4Δ2, then βat2=β4 for some at, where 0<tp2. It follows that there are at:β2β4β6β2, and at:β3β5β71. Thus, G0=at acting on Γ(0) has two orbits, which is a contradiction, so β4Δ2.

    If β4Δ1, then 1at=β4 for some at, where 0<tp2. Further, there are at:1β4β71, at:β2β5β8β2, and at:β3β6β9β3. Thus, G0=at acting on Γ(0) has three orbits, which is a contradiction, so β4Δ1 and β4Δi with 4iλ. Without loss of generality, set β4Δ4 for convenience, and we deduce that β4 has (λ3)(p1) different choices.

    If β5Δ4, then βak4=β5 for some ak, where 0<kp2. It follows that there is ak:β4β5β61. Thus, (k,p1)=1, 1Δ4, and G0=ak acting on Γ(0) has only one orbit, which is a contradiction, so β5Δ4.

    If β5Δ3, then βak3=β5 for some ak, where 0<kp2. Correspondingly, there are ak:β2β4β6β2 and at:1β3β51. Thus, G0=ak acting on Γ(0) has two orbits, which is a contradiction, so β5Δ3.

    If β5Δ2, then βak2=β5 for some ak, where 0<kp2. Further, there are ak:1β4β71, ak:β2β5β8β2 and ak:β3β6β9β3. Thus, G0=ak acting on Γ(0) has three orbits, which is a contradiction, so β5Δ2.

    If β5Δ1, then 1am=β5 for some am, where 0<mp2. It follows that there are am:1β5β91, am:β2β6β10β2, am:β3β7β11β3, and am:β4β8β12β4. Thus, G0=am=a acting on Γ(0) has four orbits, namely, λ=4. Since the number of generators of G0 is ϕ(p1), we obtain that am has ϕ(p1) different choices. Noting that G0 is cyclic, besides 1, β2, β3, and β4, the remaining vertices of Δ1, Δ2, Δ3, and Δ4 can be obtained by 1, β2, β3, and β4 through the conjugate action of a, a2, a3, , ap2, respectively. So

    ρ|λ=4:=(1,β2,β3,β4,1a,βa2,βa3,βa4,,1ap2,βap22,βap23,βap24)

    is a cyclic permutation of F#. It follows that the number of ρ is determined by the choices of 1, β2, β3, β4, and a. Further, the number of ρ|λ=4 equals

    (λ1)(p1)(λ2)(p1)(λ3)(p1)ϕ(p1)
    =(41)!(p1)3ϕ(p1).

    Let the corresponding maps generated by ρ|λ=4 be

    M4:=M4(1,β2,β3,β4,a).

    Thus, the number of different orientable vertex imprimitive complete maps equals 3!(p1)3ϕ(p1) if λ=4.

    Next, suppose that λ6 as λ5. According to the above derivation, we can obtain that β5Δi with 1i4, and β5Δj with 5jλ. Without loss of generality, set β5Δ5 for convenience, and further, β5 has (λ4)(p1) different choices. Similarly, β6Δi with 6iλ. It follows that λ=6 and β6 has (λ5)(p1) different choices. Note that a has ϕ(p1) different choices, then

    ρ|λ=6:=(1,β2,,β6,1a,βa2,,βa6,,1ap2,βap22,,βap26)

    is a cyclic permutation of F#. Thus, the number of ρ|λ=6 equals

    (λ1)(p1)(λ2)(p1)(λ5)(p1)ϕ(p1)
    =(61)!(p1)5ϕ(p1).

    Let the corresponding maps generated by ρ|λ=6 be

    M6:=M6(1,β2,β3,β4,β5,β6,a).

    Thus the number of different orientable vertex imprimitive complete maps equals 5!(p1)5ϕ(p1) if λ=6.

    In fact, λ can be generalized. If Gα=a acting on Γ(α) has λ orbits, then βiΔi such that β1=1 and 1iλ, and

    ρ|λ:=(1,β2,,βλ,1a,βa2,,βaλ,,1ap2,βap22,,βap2λ)

    is a cyclic permutation of F# (see Figure 1). Since βi has (λi+1)(p1) different choices with 2iλ, and a has ϕ(p1) different choices, it follows that the number of ρ|λ equals

    (λ1)(p1)(λ2)(p1)(λλ+1)(p1)ϕ(p1)
    =(λ1)!(p1)λ1ϕ(p1).
    Figure 1.  Cyclic permutations of F#.

    Let the corresponding maps generated by ρ|λ be

    Mλ:=Mλ(1,β2,β3,,βλ,a).

    Hence if GαZp1, then there are exactly (λ1)!(p1)λ1ϕ(p1) different orientable vertex imprimitive complete maps.

    Remark. The proof of Lemma 3.3 provides a general construction for orientable vertex imprimitive embeddings of complete graphs.

    Recall that a Cayley map CayM(G,S) is called balanced if s and s are placed on the antipodal points for all elements sS, see [7]. Let η be the unique involution of GL(1,pd). Since the map Mλ is a Cayley map of the group F+ by Lemma 3.2, then

    η: xx, for all xF+

    is an automorphism of Mλ.

    Lemma 3.4. A map Mλ is balanced if and only if β1i=βi+pd12 with 1iλ.

    Proof. Assume that Mλ is balanced, then the vertex β1i is placed at the antipodal position of the vertex βi with p as an odd prime and 1iλ. Thus, β1i=βi+pd12.

    Conversely, assume that β1i=βi+pd12, then for any 1lp2, we can obtain that

    β1i+lλ=(β1i)al=(βi+pd12)al=βpd12+i+lλ,

    reading the subscripts modulo (pd1). So, β1j=βpd12+j is at the antipodal position of βj for all j with 1jpd12, and, therefore, Mλ is balanced.

    We notice that many different orientable vertex imprimitive complete maps may be isomorphic. To determine the number of non-isomorphic complete maps, we prepare the following lemmas, and we first give the well-known Clifford's theorem.

    Lemma 4.1. ([25, Theorem 5.9]) Let V be an irreducible FH-module and let N be a normal subgroup of H. Then the following statements are true:

    (i) V is a completely reducible FN-module, and

    V=Wn1Wn2Wnr,

    where Wi(i=1,2,...,r) are all non-isomorphic irreducible FN-submodules of V.

    (ii) H permutes {Wn1,Wn2,,Wnr} transitively.

    (iii) If K is the stabilizer of H on Wn1, then H is irreducible on Wn1.

    According to Lemma 4.1, we can get the next following lemma which will determine the normalizer of Zp1 in GL(d,p).

    Lemma 4.2. Let GZdp:Zp1. Then NGL(d,p)(Zp1)GL(d,p) and Aut(G)Zdp:GL(d,p).

    Proof. Let V=Zdp, namely, consider Zdp as a d-dimensional linear space over field Fp. By [26, Theorem 7.3 of Chapter 2], we can obtain that GL(d,p) has a cyclic subgroup Zpd1. Since Zp1 is a normal subgroup of Zpd1, and Zp1 acting on Zdp is reducible, equivalently, p1 is not a primitive divisor of pd, then due to Lemma 4.1, we have

    Zdp=V1V2,

    where dim(Vi)=d2 and Vi is a faithful irreducible FpZp1-module with i=1,2. By [27, 27.14(3)], it follows that CGL(d,p)(Zp1)=GL(d,p). Since

    CGL(d,p)(Zp1)NGL(d,p)(Zp1)GL(d,p),

    it is easy to see that NGL(d,p)(Zp1)GL(d,p). Furthermore, by [28, Lemma 4.5], we have

    Aut(G)Zdp:NGL(d,p)(Zp1)Zdp:GL(d,p).

    Two maps M1 and M2 are isomorphic if there is a one-to-one correspondence from the vertices of M1 to the vertices of M2 that maps flags to flags, and it is denoted by M1M2. It follows that AutM1AutM2 if M1M2. A complete map is a complete Cayley map if its automorphism group is regular on the vertices. Moreover, the complete Cayley maps of non-isomorphic groups are not isomorphic, and we have the following lemma.

    Lemma 4.3. MσλMλ for each σAut(G). On the contrary, σAut(G) if MσλMλ.

    Proof. Since G=Aut(Mλ)Zdp:Zp1, then GαZp1 is a cyclic group for any αV. Suppose that σ fixes α for each σAut(G)Zdp:GL(d,p). Note that Zdp is a regular and normal subgroup of Aut(G), then for any 1xZdp, we have αx=αx or x1α if x is the right or left multiplication, respectively. Thus, αxα, namely, x does not fix α. Hence, σGL(d,p). It follows that Zσp1Zp1 since Zp1GL(d,p). Note that for each τAut(G),

    Mτλ=Mxσλ=MσλMλ

    such that τ=xσ, where xZdp and σGL(d,p). Moreover, we can obtain MσλMλ for each σAut(G) by arbitrariness of x.

    On the contrary, if MσλMλ, then Aut(Mσλ)Aut(Mλ)=G. It follows that for each σAut(Mλ),

    (Aut(Mλ))σ=Gσ=GAut(Mσλ).

    Since G is a Frobenius group, it is easy to see that the center Z(G)=1, then GG/Z(G)Inn(G)Aut(G). Hence, σAut(G).

    Now, we determine the number of non-isomorphic orientable vertex imprimitive complete maps if GαZp1.

    Let

    Aλ={Mλ(1,β2,β3,,βλ,a)|β1=1,βiΔi,βai=βi+λ,
    where1iλ,o(a)=p12,andreadthesubscriptsmodulopd1}.

    Then Aλ is a finite nonempty set and |Aλ|=(λ1)!(p1)λ1ϕ(p1). Let X=Aut(G). Thus, by Lemma 4.2, we have

    XZdp:NGL(d,p)(Zp1)Zdp:GL(d,p).

    Note that ZdpX and Zdp acts on V regularly, and, thus, by [29, Exercise 1.4.1], we have XαGL(d,p), GX, and GαXα. Further, by [26, Theorem 7.3 of Chapter 2], we can obtain that GL(d,p) has a cyclic subgroup Zpd1 and, for convenience, z:=Zpd1.

    Lemma 4.4. If GF+:Zp1 and λ is a prime, then there are (λ1)!(p1)λ1ϕ(p1)ϕ(pd1)|SL(d,p)| non-isomorphic orientable vertex imprimitive complete maps.

    Proof. Since o(a)=p1=pd1λ, it follows that zλ=a. Let

    (1,β2,β3,,βλ,1a,βa2,βa3,,βaλ,,1ap2,βap22,βap23,,βap2λ)

    be a cyclic permutation of F# such that βi=1zi and 2i<λ.

    Thus, we have

    zi:1βiβ2i11,
    zi:β2βi+1β2iβ2,
    zi:βi1β2i2β3i3βi1.

    That is, zi can be identified with the permutation

    zi=(1βiβ2i1βpdi+1)(β2βi+1β2iβpdi+2)(βi1β2i2β3i3βpd1).

    Thus, Gα=zi and a=zλzi. Further, i|λ, which is a contradiction, as λ is a prime.

    Let (1,β2,β3,,βλ,1a,βa2,βa3,,βaλ,,1ap2,βap22,βap23,,βap2λ) be a cyclic permutation of F# such that β2=1z, and it gives rise to a unique orientable complete map M1. We have

    z:1β2β3βλ1aβa2βaλ1,

    namely, z can be identified with the permutation

    z=(1,β2,,βλ,1a,βa2,,βaλ,,1ap2,βap22,,βap2λ).

    It follows that Aut(M1)=F+:z=G.λ>G and M1 is arc transitive. Thus, M1A1, A1Aλ and

    |AλA1|=|Aλ||A1|=(λ1)!(p1)λ1ϕ(p1)ϕ(pd1).

    So, XG contains no element, which is an automorphism of Mλ for MλAλA1. Since GX and

    (X/G)Mλ={xGX/G|(Mλ)xG=(Mλ)Gx=(Mλ)x=Mλ}=G,

    then we have that X/G acting on AλA1 is semi-regular.

    Let X act on AλA1. It follows that (Mλ)X is an orbit of this action, and the length of this orbit equals

    |(Mλ)X|=|X||XMλ|=|X||Aut(Mλ)|=|X||G|=|Zdp:GL(d,p)||Zdp:Zp1|=|SL(d,p)|.

    Thus, by Lemma 4.3, there are

    |AλA1||SL(d,p)|=|Aλ||A1||SL(d,p)|=(λ1)!(p1)λ1ϕ(p1)ϕ(pd1)|SL(d,p)|

    non-isomorphic orientable vertex imprimitive complete maps.

    Below, we give an example to show existence of the orientable vertex imprimitive complete maps.

    Example 4.5. Let M be a Cayley map of Z33 with p=3 and d=3. Then GZ33:Z2 is a Frobenius group and GαZ2 acting on Z33 is half-transitive. Since 2 is not a primitive divisor of 331, it follows that M is an orientable vertex imprimitive embedding of K27, and Gα acting on Γ(α) has λ=13 orbits. Furthermore, by Lemma 4.4, we can obtain that there are |A13||A1||SL(3,3)| non-isomorphic such maps.

    Next, we can obtain the following results by the proof of Lemma 4.4.

    Corollary 4.6. If λ=p1p2 with pi different primes and i=1,2, then the number of non-isomorphic orientable vertex imprimitive complete maps equals

    |Ap1p2(Ap1Ap2)||SL(d,p)|=|Ap1p2||Ap1||Ap2|+|A1||SL(d,p)|.

    Corollary 4.7. If λ=p21p2 with pi different primes and i=1,2, then the number of non-isomorphic orientable vertex imprimitive complete maps equals

    |Ap21p2(Ap1p2Ap21)||SL(d,p)|=|Ap21p2||Ap1p2||Ap21|+|Ap1||SL(d,p)|.

    It is an open problem to generalize the above corollaries for the general case in which λ=pl11pl22pltt, where pi(1it) are pairwise different primes and li1 are arbitrary positive integers.

    In this section, we complete the proof of Theorem 1.1 in view of the above series of results.

    Proof of Theorem 1.1. Let M=(V,E,F) be an orientable vertex imprimitive complete map. Let G=Aut(M). By Lemma 3.2, we have that M is a Cayley map of Zdp and GZdp:Gα is a Frobenius group, where Gα is a cyclic group for each αV, p is an odd prime, and d2. Further, if GαZp1 acting on the neighborhood of α has λ orbits with λ(p1)=pd1 and λ4 is a prime, then by Lemma 3.3 and Lemma 4.4, there are exactly

    [(λ1)!(p1)λ1ϕ(p1)ϕ(pd1)]/|SL(d,p)|

    non-isomorphic orientable vertex imprimitive complete maps.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The work on this paper was in part done when the author visited South University of Science and Technology. The author is very thankful for Professor Cai Heng Li. Also, the author would like to thank the anonymous reviewers for their valuable comments and suggestions. This work was supported by the NSFC(11861076), the Natural Science Foundation of Henan Province(232300420357).

    The author declare there is no conflict of interest.



    [1] Y. Q. Feng, J. H. Kwak, J. X. Zhou, Enumerating reflexible 2-cell embeddings of connected graphs, Sci. China Math., 56 (2013), 933–950. https://doi.org/10.1007/s11425-012-4544-2 doi: 10.1007/s11425-012-4544-2
    [2] L. D. James, G. A. Jones, Regular orientable imbeddings of complete graphs, J. Combin. Theory Ser. B, 39 (1985), 353–367.
    [3] V. P. Korzhik, H. J. Voss, On the number of nonisomorphic orientable regular embeddings of complete graphs, J. Combin. Theory Ser. B, 81 (2001), 58–76.
    [4] N. L. Biggs, Classification of complete maps on orientable surfaces, Rend. Mat., 4 (1971), 645–655.
    [5] N. L. Biggs, Cayley maps and symmetrical maps, in Mathematical Proceedings of the Cambridge Philosophical Society, 72 (1972), 381–386.
    [6] R. B. Richter, J. Širáň, R. Jajcay, T. W. Tucker, M. E. Watkins, Cayley maps, J. Combin. Theory Ser. B, 95 (2005), 189–245. https://doi.org/10.1016/j.jctb.2005.04.007
    [7] M. Škoviera, J. Širáň, Regular maps from Cayley graphs, Part 1: balanced Cayley maps, Discrete Math., 109 (1992), 265–276. https://doi.org/10.1016/0012-365X(92)90296-R doi: 10.1016/0012-365X(92)90296-R
    [8] C. H. Li, Vertex transitive embeddings of complete graphs, J. Combin. Theory Ser. B, 99 (2009), 447–454. https://doi.org/10.1016/j.jctb.2008.09.002 doi: 10.1016/j.jctb.2008.09.002
    [9] J. Širáň, T. W. Tucker, Characterization of graphs which admit vertex-transitive embeddings, J. Graph Theory, 55 (2007), 233–248. https://doi.org/10.1002/jgt.20239 doi: 10.1002/jgt.20239
    [10] X. Yu, Q. S. Zhang, Orientable vertex transitive embeddings of Kp, AIMS Math., 8 (2023), 15024–15034. https://doi.org/10.3934/math.2023767 doi: 10.3934/math.2023767
    [11] L. D. James, Edge-symmetric orientable imbeddings of complete graphs, European J. Combin., 11 (1990), 133–144.
    [12] X. Yu, B. G. Lou, The edge-regular complete maps, Open Math., 18 (2020), 1719–1726. https://doi.org/10.1515/math-2020-0115 doi: 10.1515/math-2020-0115
    [13] J. Y. Chen, W. W. Fan, Complete bipartite multi-graphs with a unique regular dessin, J. Algebr. Combin., 54 (2021), 635–649. https://doi.org/10.1007/s10801-021-01019-9 doi: 10.1007/s10801-021-01019-9
    [14] W. W. Fan, C. H. Li, The complete bipartite graphs with a unique edge-transitive embedding, J. Graph Theory, 87 (2018), 581–586. https://doi.org/10.1002/jgt.22176 doi: 10.1002/jgt.22176
    [15] W. W. Fan, C. H. Li, S. H. Qiao, Complete circular regular dessins of coprime orders, Discrete Math., 346 (2023), 113189. https://doi.org/10.1016/j.disc.2022.113189 doi: 10.1016/j.disc.2022.113189
    [16] W. W. Fan, C. H. Li, and N. Wang, Edge-transitive uniface embeddings of bipartite multi-graphs, J. Algebr. Combin., 49 (2019), 125–134. https://doi.org/10.1007/s10801-018-0821-7 doi: 10.1007/s10801-018-0821-7
    [17] Y. Q. Feng, K. Hu, R. Nedela, M. Skoviera, N. E. Wang, Complete regular dessins and skew-morphisms of cyclic groups, Ars Math. Contemp., 18 (2020), 289–307.
    [18] X. Yu, B. G. Lou, W. W. Fan, The complete bipartite graphs which have exactly two orientably edge-transitive embeddings, Ars Math. Contemp., 18 (2020), 371–379.
    [19] S. Lawrencenko, A. M. Magomedov, Generating the triangulations of the torus with the vertex-labeled complete 4-partite graph K2,2,2,2, Symmetry, 13 (2021), 1418. https://doi.org/10.3390/sym13081418 doi: 10.3390/sym13081418
    [20] L. D. James, Imbeddings of the complete graph, Ars Combin., 16 (1983), 57–72.
    [21] V. P. Korzhik, H. J. Voss, Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs, J. Combin. Theory Ser. B, 86 (2002), 186–211.
    [22] B. P. Mull, R. G. Rieper, A. T. White, Enumerating 2-cell imbeddings of connected graphs, Proc. Amer. Math. Soc., 103 (1988), 321–330.
    [23] N. L. Biggs, A. T. White, Permutation Groups and Combinatorial Structures, Cambridge University Press, Cambridge-New York, 1979.
    [24] R. Jajcay, R. Nedela, Half-regular Cayley maps, Graphs Combin., 31 (2015), 1003–1018. https://doi.org/10.1007/s00373-014-1428-y
    [25] P. Webb, A Course in Finite Group Representation Theory, Cambridge University Press, Cambridge, 2016.
    [26] B. Huppert, Endliche Gruppen I, Springer-Verlag, Berlin, 1967.
    [27] M. Aschbacher, Finite Group Theory, Cambridge University Press, Cambridge, 2000.
    [28] A. Devillers, W. Jin, C. H. Li, C. E. Praeger, On normal 2-geodesic transitive Cayley graphs, J. Algebr. Combin., 39 (2014), 903–918. https://doi.org/10.1007/s10801-013-0472-7 doi: 10.1007/s10801-013-0472-7
    [29] J. D. Dixon, B. Mortimer, Permutation Groups, Springer-Verlag, New York, 1996.
  • This article has been cited by:

    1. Xue Yu, Cai Heng Li, Ben Gong Lou, Orientable Vertex Primitive Complete Maps, 2024, 0218-0006, 10.1007/s00026-024-00721-2
    2. Dipendu Maity, Vertex-Transitive Toroidal Maps, 2024, 0250-541X, 10.1007/s40009-024-01581-3
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(868) PDF downloads(43) Cited by(2)

Figures and Tables

Figures(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog