| 图的3限制性边割 |
| |
| 引用本文： | 欧见平,张福基.图的3限制性边割[J].运筹学学报,2004,8(2):61-65. |
| |
| 作者姓名： | 欧见平 张福基 |
| |
| 作者单位： | 1. 福建省漳州师范学院数学系 363000;广东省汕头大学数学系 515063
2. 厦门大学数学系,361005 |
| |
| 基金项目： | 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限制性边割的图在本文中得到刻划．
|
| 关 键 词： | 运筹学 图 3限制边割 花 连通图 |
3-Restricted Edge Cut of Graphs |
| |
| Abstract.3-Restricted Edge Cut of Graphs[J].OR Transactions,2004,8(2):61-65. |
| |
| Authors: | Abstract |
| |
| Abstract: | 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. |
| |
| Keywords: | OR Graph 3-restricted edge cut flower |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
