51. Frobenius maps
- Author
-
Yan Wang and Jin Ho Kwak
- Subjects
Discrete mathematics ,Frobenius map ,Exponent ,Frobenius group ,Graph ,Cayley map ,Theoretical Computer Science ,Combinatorics ,Frobenius graph ,Mathematics::Category Theory ,Discrete Mathematics and Combinatorics ,Regular graph ,Mathematics ,Regular - Abstract
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).
- Published
- 2005
- Full Text
- View/download PDF