A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a...A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a classification of all s-regular cyclic coverings of the complete bipartite graph of order 6 was given in [8] for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. In this paper, the authors classify all s-regular dihedral coverings of the complete graph of order 4 for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. As a result, a new infinite family of cubic 1-regular graphs is constructed.展开更多
基金the Excellent Young Teachers Program of the Ministry of Education of Chinathe National Natural Science Foundation of China+1 种基金 the Scientific Research Foundation for the Returned Overseas Chinese Scholars the Ministry of Education of China and the Com2MaC-KOSEF in Korea.
文摘A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. An infinite family of cubic 1-regular graphs was constructed in [7] as cyclic coverings of the three-dimensional Hypercube, and a classification of all s-regular cyclic coverings of the complete bipartite graph of order 6 was given in [8] for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. In this paper, the authors classify all s-regular dihedral coverings of the complete graph of order 4 for each s ≥ 1, whose fibre-preserving automorphism subgroups act arc-transitively. As a result, a new infinite family of cubic 1-regular graphs is constructed.
