Orientable vertex transitive embeddings of $ {{\sf K}}_p $
Xue Yu, Qingshan Zhang
Abstract
Open-access reader
Xue Yu, Qingshan Zhang
Abstract
Open-access reader
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 $ {{\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.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 $ {{\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.
Key concepts: Combinatorics, Transitive relation, Vertex (graph theory), Mathematics, Prime (order theory), Discrete mathematics, Graph