Heawood图的s-正则循环覆盖  

s-Regular Cyclic Coverings of Heawood Graph

作　　者：刘志强[1] 冯衍全[1] 

机构地区：[1]北京交通大学理学院,北京100044

出　　处：《北京交通大学学报》2004年第6期28-31,共4页JOURNAL OF BEIJING JIAOTONG UNIVERSITY

基　　金：国家自然科学基金资助项目(1007002);北京交通大学校基金资助项目(2004SM)

摘　　要：一个图称为s＿正则的,如果它的自同构群作用在它的s＿弧集上是正则的.Feng通过对立方体和6阶完全两部图循环覆盖的研究,构造了两个3度1＿正则的无限类.本文证明了Heawood图的循环覆盖至多是2＿正则的,并且构造了另一个新的3度1＿正则图的无限类.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.

关 键 词：图论 S-正则图 s-弧传递图 正则覆盖 Heawood图 

分 类 号：O157.5[理学—数学]