1 research outputs found
Orientable vertex transitive embeddings of
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 , where is a prime. Moreover, we obtain the number of non-isomorphic orientable vertex-transitive complete maps with vertices