| 周长为4不含3圈的m限制边连通图 |
| |
| 引用本文： | 朱铁丹,王经雨.周长为4不含3圈的m限制边连通图[J].数学的实践与认识,2011,41(24). |
| |
| 作者姓名： | 朱铁丹 王经雨 |
| |
| 作者单位： | 五邑大学数学与计算科学学院,广东 江门,529020 |
| |
| 基金项目： | 国家自然科学基金资助(10801091); 广东省自然科学基金资助(9151051501000072) |
| |
| 摘 要： | m限制边割是连通图的一个边割,它将此图分离成阶不小于m的连通分支刻画了周长为4,不含3圈的m限制边割的图类.
|
| 关 键 词： | 周长 限制边割 限制边连通 |
m-Restricted Edge Cut of Graphs with 4 Circumference and 3 Free |
| |
| ZHU Tie-dar
,
WAHG Jing-yu.m-Restricted Edge Cut of Graphs with 4 Circumference and 3 Free[J].Mathematics in Practice and Theory,2011,41(24). |
| |
| Authors: | ZHU Tie-dar WAHG Jing-yu |
| |
| Institution: | ZHU Tie-dan,WAHG Jing-yu (School of Mathematics and Computational Science,Wuyi University,Jiangmen 529020,China) |
| |
| Abstract: | m-restricted edge cut is a edge cut of graphs,it separates this graph into components each having order at least m.The paper characterize m-restricted edge cut of graphs with 4 circumference and 3 free. |
| |
| Keywords: | circumference restricted edge cut restricted edge connectivity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
