s-Regular Cyclic Coverings of Heawood Graph
Yan‐Quan Feng · 2004
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. By studying s-regular cyclic covering of the three-dimensional hypercube and complete bipartite graph K( 3,3), Feng constructed two infinite families of cubic 1-regular graphs. In this paper, we prove that the cyclic coverings of Heawood is at most 2-regular and construct a new infinite family of cubic 1-regular graphs.