| 周长为3的m限制边割连通图 |
| |
| 引用本文： | 王经雨,朱铁丹.周长为3的m限制边割连通图[J].数学的实践与认识,2009,39(18). |
| |
| 作者姓名： | 王经雨 朱铁丹 |
| |
| 作者单位： | 五邑大学,数理系,广东,江门,529020 |
| |
| 摘 要： | 如果连通图的G存在边割S,使得G-S的每一个连通分支都含有至少m个顶点,则称图G是m限制边连通的.本文刻画了周长为3的m限制边连通图.
|
| 关 键 词： | 图 周长 边连通性 |
m-restricted Edge cut of Graphs with 3 Circumference |
| |
| WANG Jing-yu,ZHU Tie-dan.m-restricted Edge cut of Graphs with 3 Circumference[J].Mathematics in Practice and Theory,2009,39(18). |
| |
| Authors: | WANG Jing-yu ZHU Tie-dan |
| |
| Abstract: | An m-restricted edge cut is an edge cut of a connected graph which disconnects this graph with each component having order at least m, the paper characterize m-restricted edge cut of graphs with 3 circumference. |
| |
| Keywords: | graph circumference restricted edge connectivity |
| 本文献已被 万方数据 等数据库收录！ |
|
