Frobenius maps Original Research Article

A graph is called Frobenius if it is a connected orbital regular graph of a Frobenius group. A Frobenius map is a regular Cayley map whose underlying graph is Frobenius. In this paper, we show that almost all low-rank Frobenius graphs admit regular embeddings and enumerate non-isomorphic Frobenius maps for a given Frobenius graph. For some Frobenius groups, we classify all Frobenius maps derived from these groups. As a result, we construct some Frobenius maps with trivial exponent groups as a partial answer of a question raised by Nedela and Škoviera (Exponents of orientable maps, Proc. London Math. Soc. 75(3) (1997) 1–31).