图的3限制性边割(英文)  

3-Restricted Edge Cut of Graphs

作　　者：欧见平[1] 张福基[2] 

机构地区：[1]福建省漳州师范学院数学系 [2]厦门大学数学系,361005

出　　处：《运筹学学报》2004年第2期61-65,共5页Operations Research Transactions

基　　金：Supported by NNSF of China (Grant No. 10271105); Foundation of Education Ministry of Fujian Province (Grant No. AJ03147); Foundation of Science and Technology Ministry of Fujian Province (Grant No. 2003J036)

摘　　要：3限制性边割将连通图分离成不连通图,使其各连通分支含有至少3个顶点. 含3限制性边割的图在本文中得到刻划.A 3-Restricted edge cut is such an edge cut that separates a connected graph into a disconnected one with each component having order at least 3. Graphs that contain 3-Restricted edge cut are characterized in this paper.

关 键 词：运筹学 图 3限制边割 花 连通图 

分 类 号：O22[理学—运筹学与控制论] O157.5[理学—数学]