An infinite family of simple graphs underlying chiral, orientable reflexible and non-orientable rotary maps
Abstract
In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces, as well as a skeleton of a reflexible map on a non-orientable surface. This family consists of all lexicographic product Cn[mK1], where m 3, n = sm, with s an integer not divisible by 4. This answers a question posed in [S.\ Wilson, Families of regular graphs in regular maps, Journal of Combinatorial Theory, Series B 85 (2002), 269--289].
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.