| K_(1,n)-free图具有给定性质的[a,b]-因子的一个充分条件 |
| |
| 引用本文： | 于卿枝,薛秀谦. K_(1,n)-free图具有给定性质的[a,b]-因子的一个充分条件[J]. 数学的实践与认识, 2006, 36(12): 233-236 |
| |
| 作者姓名： | 于卿枝 薛秀谦 |
| |
| 作者单位： | 1. 徐州空军学院基础部,江苏,徐州,221006
2. 中国矿业大学理学院,江苏,徐州,221008 |
| |
| 摘 要： | 图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件.
|
| 关 键 词： | K1,n-free图 [a,b]-因子 最小度 覆盖图 |
| 修稿时间： | 2004-10-25 |
A Sufficient Conditions for a K1,n-free Graph to Have [a, b]- Factors with Given Properties |
| |
| YU Qing-zhi,XUE Xiu-qian. A Sufficient Conditions for a K1,n-free Graph to Have [a, b]- Factors with Given Properties[J]. Mathematics in Practice and Theory, 2006, 36(12): 233-236 |
| |
| Authors: | YU Qing-zhi XUE Xiu-qian |
| |
| Abstract: | A graph Gis called K_1,n-free if it contains no K_1,n as an induced subgraph.A sufficient conditions depending on minimum degree for aK_(1,n)-free graph to have a special [a,b]-factor is given. |
| |
| Keywords: | K_1 n-free graph [a b]-factor minimum degree [a b]-covered graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
