| 图的分数k-因子 |
| |
| 引用本文： | 张兰菊,刘桂真. 图的分数k-因子[J]. 系统科学与数学, 2001, 21(1): 88-92 |
| |
| 作者姓名： | 张兰菊 刘桂真 |
| |
| 作者单位： | 山东大学数学与系统科学学院, |
| |
| 基金项目： | 国家自然科学基金和博士点基金资助课题 |
| |
| 摘 要： | 给定图G=(V,E).设a和b是两个非负整数.fE→［0,1］是一个函数.如果
|
| 关 键 词： | 因子 分数因子 增广路. |
| 修稿时间： | 1999-03-24 |
FRACTIONAL k-FACTORS OFGRAPHS |
| |
| Zhang Lanju,Liu Guizhen. FRACTIONAL k-FACTORS OFGRAPHS[J]. Journal of Systems Science and Mathematical Sciences, 2001, 21(1): 88-92 |
| |
| Authors: | Zhang Lanju Liu Guizhen |
| |
| Abstract: | Fractional graph theory is a new research subject in graph theory. Some results have been achieved concerning fractional matching, fractional coloring etc. Given a graph G=(V, E). Let a and b be two nonnegative integers. Let f:E ［0,1］ be a function. We call f a fractional ［a,b］-factor of G, if a e xf(e) b for all x V. A fractional k-factor f is a fractional ［a, b］-factor with a=b=k. In this article we give a necessary and sufficient condition for a graph to have a fractional k-factor with augmenting path method. |
| |
| Keywords: | |
| 本文献已被 万方数据 等数据库收录！ |
|
