Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
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
This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
Comments on this article