| Rm-边割存在的充分条件 |
| |
| 引用本文： | 欧见平,张福基. Rm-边割存在的充分条件[J]. 吉首大学学报(自然科学版), 2002, 23(1): 21-23 |
| |
| 作者姓名： | 欧见平 张福基 |
| |
| 作者单位： | (1.漳州师院数学系，福建 漳洲363000；2.厦门大学数学系，福建 厦门361005) |
| |
| 基金项目： | Supperted by Natural Science Foundation of China(19971071) |
| |
| 摘 要： | Rm边割是这样一种边割, 它将连通图分割为各分支的阶都不小于m的不连通图. 设G是一个阶不小于2m的连通图. 用 c(G)表示G的周长 (即G中最长圈的长度)， 如果c(G)≥m+1, 那么G含有Rm边割, 而且周长c的下界在一定程度上是不可改进的.
|
| 关 键 词： | 图 Rm边割 周长 |
| 文章编号： | 1007-2985(2002)01-0021-03 |
Sufficiency for the Existence of Rm -EDGE CUT |
| |
| OU Jian ping ,,ZHANG Fu ji. Sufficiency for the Existence of Rm -EDGE CUT[J]. Journal of Jishou University(Natural Science Edition), 2002, 23(1): 21-23 |
| |
| Authors: | OU Jian ping ZHANG Fu ji |
| |
| Affiliation: | (1.Department of Mathematics, Zhangzhou Normal College,Zhangzhou 363000,Fujian China；2.Department of Mathematics, Xiamen University, Xiamen 361005,Fujian China) |
| |
| Abstract: | Rm - edge cut is such an edge cut that separates a connected graph into a disconnected one with no component having order less than m. Let G be a connected graph with order at least 2m. Write c(G) for the circumference of graph G, i.e., the length of the longest cycle in G. It is proved in this paper that graph G contains Rm - edge cuts if c(G) ≥m+ 1. The lower bound of c(G) is sharp to some extent. |
| |
| Keywords: | Graph R m-edge cut Circumference. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《吉首大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《吉首大学学报(自然科学版)》下载全文 |
