Show simple item record

dc.contributor.author欧见平
dc.contributor.author张福基
dc.date.accessioned2017-11-14T02:51:25Z
dc.date.available2017-11-14T02:51:25Z
dc.date.issued2004-08-25
dc.identifier.citation数学研究与评论,2004,(03):24-28
dc.identifier.issn1000-341X
dc.identifier.otherSXYJ200403004
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/154953
dc.description.abstract设图G是一个K-正则连通点可迁图.如果G不是极大限制性边连通的,那么G含有一个(k-1)-因子,它的所有分支都同构于同一个阶价于k和2k-3之间的点可迁图.此结果在某种程度上加强了Watkins的相应命题:如果k正则点可迁图G不是k连通的,那么G有一个因子,它的每一个分支都同构于同一个点可迁图.
dc.description.abstractLet 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.
dc.description.sponsorshipSupported by NNSF of China(10271105);; Doctoral Foundation of Zhangzhou Normal College.
dc.language.isozh_CN
dc.subject点可迁图
dc.subject正则因子
dc.subject限制性边割
dc.subject断片
dc.subjectvertex transitive graph
dc.subjectregular factor
dc.subjectrestricted edge cut
dc.subjectfragment.
dc.title点可迁图中的正则因子(英文)
dc.title.alternativeRegular Factor in Vertex Transitive Graphs
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record