| K_(1,n)-free图有(g,f)-因子的最小度条件 |
| |
| 引用本文： | 黄娟,李乃医.K_(1,n)-free图有(g,f)-因子的最小度条件[J].广东海洋大学学报,2007,27(1):61-63. |
| |
| 作者姓名： | 黄娟 李乃医 |
| |
| 作者单位： | 广东海洋大学理学院,广东,湛江,524088 |
| |
| 摘 要： | 讨论了图的(g,f)-因子存在问题,并给出了K1,n-free图有(g,f)-因子的一个最小度条件。
|
| 关 键 词： | K1 n_free连通图 最小度 (g f)-因子 |
| 文章编号： | 1673-9159（2007）01-0061-03 |
| 修稿时间： | 2006-03-20 |
The Existence of (g ,f) -Factors as a Minimum Degree Condition for K1,n-free Graphs |
| |
| HUANG Juan,LI Nai-yi.The Existence of (g ,f) -Factors as a Minimum Degree Condition for K1,n-free Graphs[J].Journal of Zhanjiang Ocean University,2007,27(1):61-63. |
| |
| Authors: | HUANG Juan LI Nai-yi |
| |
| Institution: | Faculty of sciences, Guangdong Ocean University, Zhanjiang 524088, China |
| |
| Abstract: | The relationship between minimum degree in K1,n-free graph and (g,f)-Factor is discussed.(g,f)-Factor as a sufficient condition for K1,n-free graph is given. |
| |
| Keywords: | K1 n-free connected graph minimum degree (g f)-factor |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
