| 分数k-消去图的度条件 |
| |
| 引用本文： | 高炜,张云港,梁立. 分数k-消去图的度条件[J]. 西北师范大学学报(自然科学版), 2011, 47(1) |
| |
| 作者姓名： | 高炜 张云港 梁立 |
| |
| 作者单位： | 云南师范大学信息学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(60903131) |
| |
| 摘 要： | 设G是一个图,若对于图G的任一边e,G-e都存在一个分数k-因子,则称G是一个分数k-消去图.证明了当顶点数、最小度以及max{dG(u),dG(v)}(其中u,v是图中任意两个不相邻顶点)满足一定条件时,G是分数k-消去图,该结论在一定意义上是最好的.
|
| 关 键 词： | 分数k-因子 分数k-消去图 度条件 |
A degree condition for fractional k-deleted graphs |
| |
| GAO Wei,ZHANG Yun-gang,LIANG Li. A degree condition for fractional k-deleted graphs[J]. Journal of Northwest Normal University Natural Science (Bimonthly), 2011, 47(1) |
| |
| Authors: | GAO Wei ZHANG Yun-gang LIANG Li |
| |
| Affiliation: | GAO Wei,ZHANG Yun-gang,LIANG Li(School of Information,Yunnan Normal University,Kunming 650092,Yunnan,China) |
| |
| Abstract: | A graph G is fractional k-deleted if there exists a fractional k-factor in G-e for any edge e of G.It is proved that G is fractional k-deleted graph when its order,minimum degree and max{dG(u),dG(v)}(where u,v are nonadjacent vertices) satisfy certain conditions.The results are proved to be best in some sense. |
| |
| Keywords: | fractional k-factor fractional k-deleted graph degree condition |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
