Regular Factor in Vertex Transitive Graphs  

点可迁图中的正则因子(英文)

作　　者：欧见平[1] 张福基[2] 

机构地区：[1]汕头大学数学系 [2]厦门大学数学系,福建厦门361005

出　　处：《Journal of Mathematical Research and Exposition》2004年第3期400-404,共5页数学研究与评论（英文版）

基　　金：Supported by NNSF of China(10271105); Doctoral Foundation of Zhangzhou Normal College.

摘　　要：Let G be a fc-regular connected vertex transitive graph. If G is not maximal restricted edge connected, then G has a (k- 1)-factor with components isomorphic to the same vertex transitive graph of order between k and 2k-3. This observation strenghen to some extent the corresponding result obtained by Watkins, which said that fc-regular vertex transitive graph G has a factor with components isomorphic to a vertex transitive graphs if G is not k connected.设图G是一个K-正则连通点可迁图.如果G不是极大限制性边连通的,那么G含有一个(k-1)-因子,它的所有分支都同构于同一个阶价于k和2k-3之间的点可迁图.此结果在某种程度上加强了Watkins的相应命题:如果k正则点可迁图G不是k连通的,那么G有一个因子,它的每一个分支都同构于同一个点可迁图.

关 键 词：vertex transitive graph regular factor restricted edge cut fragment. 

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