| 点可迁图中的正则因子 |
| |
| 引用本文： | 欧见平,张福基.点可迁图中的正则因子[J].数学研究及应用,2004,24(3):400-404. |
| |
| 作者姓名： | 欧见平 张福基 |
| |
| 作者单位： | 1. 汕头大学数学系,广东,汕头,515063;漳州师范学院数学系,福建,漳州,363000
2. 厦门大学数学系,福建,厦门,361005 |
| |
| 基金项目： | Supported by NNSF of China(10271105)，Doctoral Foundation of Zhangzhou Normal College. |
| |
| 摘 要： | 设图G是一个K-正则连通点可迁图.如果G不是极大限制性边连通的,那么G含有一个(k-1)-因子,它的所有分支都同构于同一个阶价于k和2k-3之间的点可迁图.此结果在某种程度上加强了Watkins的相应命题:如果k正则点可迁图G不是k连通的,那么G有一个因子,它的每一个分支都同构于同一个点可迁图.
|
| 关 键 词： | 点可迁图 正则因子 限制性边割 断片 |
| 收稿时间： | 2001/9/25 0:00:00 |
Regular Factor in Vertex Transitive Graphs |
| |
| OU Jian-ping and ZHANG Fu-ji.Regular Factor in Vertex Transitive Graphs[J].Journal of Mathematical Research with Applications,2004,24(3):400-404. |
| |
| Authors: | OU Jian-ping and ZHANG Fu-ji |
| |
| Institution: | Dept. of Math.; Shantou Univ.; Guangdong; China; Dept. of Math.; Zhangzhou Normal College; Fujian; China;Dept. of Math.; Xiamen University; Fujian; China |
| |
| Abstract: | 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. |
| |
| Keywords: | vertex transitive graph regular factor restricted edge cut fragment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
