2 research outputs found

    Orientably-Regular π\pi-Maps and Regular π\pi-Maps

    Full text link
    Given a map with underlying graph G\mathcal{G}, if the set of prime divisors of ∣V(G∣|V(\mathcal{G}| is denoted by π\pi, then we call the map a {\it π\pi-map}. An orientably-regular (resp. A regular ) π\pi-map is called {\it solvable} if the group G+G^+ of all orientation-preserving automorphisms (resp. the group GG of automorphisms) is solvable; and called {\it normal} if G+G^+ (resp. GG) contains a normal π\pi-Hall subgroup. In this paper, it will be proved that orientably-regular π\pi-maps are solvable and normal if 2∉π2\notin \pi and regular π\pi-maps are solvable if 2∉π2\notin \pi and GG has no sections isomorphic to PSL(2,q){\rm PSL}(2,q) for some prime power qq. In particular, it's shown that a regular π\pi-map with 2∉π2\notin \pi is normal if and only if G/O2′(G)G/O_{2^{'}}(G) is isomorphic to a Sylow 22-group of GG. Moreover, nonnormal π\pi-maps will be characterized and some properties and constructions of normal π\pi-maps will be given in respective sections.Comment: 18 pages. arXiv admin note: substantial text overlap with arXiv:2201.0430

    Nonorientable regular embeddings of graphs of order p2

    Get PDF
    AbstractA map is called regular if its automorphism group acts regularly on the set of all flags (incident vertex–edge–face triples). An orientable map is called orientably regular if the group of all orientation-preserving automorphisms is regular on the set of all arcs (incident vertex–edge pairs). If an orientably regular map admits also orientation-reversing automorphisms, then it is regular, and is called reflexible. A regular embedding and orientably regular embedding of a graph G are, respectively, 2-cell embeddings of G as a regular map and orientably regular map on some closed surface. In Du et al. (2004) [7], the orientably regular embeddings of graphs of order pq for two primes p and q (p may be equal to q) have been classified, where all the reflexible maps can be easily read from the classification theorem. In [11], Du and Wang (2007) classified the nonorientable regular embeddings of these graphs for p≠q. In this paper, we shall classify the nonorientable regular embeddings of graphs of order p2 where p is a prime so that a complete classification of regular embeddings of graphs of order pq for two primes p and q is obtained. All graphs in this paper are connected and simple
    corecore