Abstract
<abstract><p>In [<italic>J. Combin. Theory Ser. B</italic>, <bold>99</bold> (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 $ {{\sf K}}_p $, where $ p\geq 5 $ is a prime. Moreover, we obtain the number of non-isomorphic orientable vertex-transitive complete maps with $ p $ vertices.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference25 articles.
1. N. L. Biggs, Cayley maps and symmetrical maps, Proc. Cambridge Philos. Soc., 72 (1972), 381–386. https://doi.org/10.1017/s0305004100047216
2. N. L. Biggs, Classification of complete maps on orientable surfaces, Rend. Mat.(6), 4 (1971), 645–655.
3. N. L. Biggs, A. T. White, Permutation groups and combinatorial structures, vol. 33 of London Mathematical Society Lecture Note Series, Cambridge-New York: Cambridge University Press, 1979.
4. A. Devillers, W. Jin, C. H. Li, C. E. Praeger, On normal 2-geodesic transitive Cayley graphs, J. Algebraic Combin., 39 (2014), 903–918. https://doi.org/10.1007/s10801-013-0472-7
5. J. D. Dixon, B. Mortimer, Permutation groups, vol. 163 of Graduate Texts in Mathematics, New York: Springer-Verlag, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献