journal6 ›› 2002, Vol. 23 ›› Issue (1): 21-23.

• 博士论坛 • 上一篇    下一篇

Rm-边割存在的充分条件

  

  1. (1.漳州师院数学系,福建 漳洲363000;2.厦门大学数学系,福建 厦门361005)
  • 出版日期:2002-03-15 发布日期:2013-01-05

Sufficiency for the Existence of Rm-EDGE CUT

  1. (1.Department of Mathematics, Zhangzhou Normal College,Zhangzhou 363000,Fujian China;2.Department of Mathematics, Xiamen University, Xiamen 361005,Fujian China)
  • Online:2002-03-15 Published:2013-01-05
  • About author:OU Jian-ping(1965-),male,was born in Guiyang County,Hunan Provinc,a doctor candidate of dept. of mathematics,Xiamen University,majors are graphs and networks.
  • Supported by:

    Supperted by Natural Science Foundation of China(19971071)

摘要:Rm边割是这样一种边割, 它将连通图分割为各分支的阶都不小于m的不连通图. 设G是一个阶不小于2m的连通图. 用 c(G)表示G的周长 (即G中最长圈的长度), 如果c(G)≥m+1, 那么G含有Rm边割, 而且周长c的下界在一定程度上是不可改进的.

关键词: 图, Rm边割, 周长

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.

公众号 电子书橱 超星期刊 手机浏览 在线QQ