首页 | 本学科首页   官方微博 | 高级检索  
     检索      


s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3
Authors:Yan‐Quan Feng  Jin Ho Kwak
Abstract:A graph is s‐regular if its automorphism group acts freely and transitively on the set of s‐arcs. An infinite family of cubic 1‐regular graphs was constructed in 10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the s‐regular cyclic coverings of the complete bipartite graph K3,3 for each ≥ 1 whose fibre‐preserving automorphism subgroups act arc‐transitively. As a result, a new infinite family of cubic 1‐regular graphs is constructed. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 101–112, 2004
Keywords:s‐regular graphs  s‐arc‐transitive graphs  regular coverings
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号