Abstract
<abstract><p>In the work by Li (<italic>J. Combin. Theory Ser. B</italic>, <bold>99</bold> (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 $ \text{Z}_{p-1} $ with odd prime $ p $.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)