| 一个关于图是分数(k,n)-临界的邻域并条件 |
| |
| 引用本文： | 汤四平,阮妮,曹显兵. 一个关于图是分数(k,n)-临界的邻域并条件[J]. 数学的实践与认识, 2010, 40(6) |
| |
| 作者姓名： | 汤四平 阮妮 曹显兵 |
| |
| 作者单位： | 1. 湖南科技大学,数学院,湖南,411201
2. 北京工商大学,应用数学系,北京,100048 |
| |
| 基金项目： | 北京市自然科学基金(1052007) |
| |
| 摘 要： | 设G是一个图,以及k是满足1≤k的整数.一个图G在删除任意n个顶点后的子图均含有分数k-因子,则称G是一个分数(k,n)-临界图.给出了图是一个分数(k,n)-临界图的一个邻域并条件,并且该条件是最佳的.
|
| 关 键 词： | 分数因子 分数(k,n)-临界图 |
A Neighborhood Union Condition for Graphs to Be Fractional(k,n)-Critical |
| |
| TANG Si-ping,RUAN Ni,CAO Xian-bing. A Neighborhood Union Condition for Graphs to Be Fractional(k,n)-Critical[J]. Mathematics in Practice and Theory, 2010, 40(6) |
| |
| Authors: | TANG Si-ping RUAN Ni CAO Xian-bing |
| |
| Affiliation: | TANG Si-ping~1,RUAN Ni~1,CAO Xian-bing~2 (1.Department of Mathematics Hunan University of Science , Technology,Hunan 411201,China) (2.Department of Applied Mathematics,Beijing Technology , Business University,Beijing 100048,China) |
| |
| Abstract: | Let G be a graph,and let k be nonnegative integer with 1≤k.A graph G is called a fractional(k,n)-critical graph if after deleting any n vertices of G the remaining graph of G has a fractional k-factor.In this paper a neighborhood union condition for graphs to be fractional(k,n)-critical is given,and the condition is sharp. |
| |
| Keywords: | fractional factor fractional(k n)-critical graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
