In [J. Combin. Theory Ser. B, 99 (2009), 447-454)], Li 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-transitive embeddings of
- Article type
- Year
Open Access
Research Article
Issue
Open Access
Research Article
Issue
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
京公网安备11010802044758号