吉首大学学报（自然科学版）2002，Vol.23Issue(1)：21-23，28,4.
Rm-边割存在的充分条件
Sufficiency for the Existence of Rm -EDGE CUT
摘要
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.关键词
图/Rm边割/周长Key words
Graph/Rm - edge cut/Circumference分类
数理科学引用本文复制引用
欧见平,张福基..Rm-边割存在的充分条件[J].吉首大学学报（自然科学版）,2002,23(1):21-23，28,4.基金项目
Supperted by Natural Science Foundation of China(19971071) （19971071）
