| 图的分数κ-因子 |
| |
| 引用本文： | 张兰菊,刘桂真.图的分数κ-因子[J].系统科学与数学,2001,21(1):088-092. |
| |
| 作者姓名： | 张兰菊 刘桂真 |
| |
| 作者单位： | 山东大学数学与系统科学学院! 济南250100，山东大学数学与系统科学学院!济南250100 |
| |
| 基金项目： | 国家自然科学基金，博士点基金 |
| |
| 摘 要： | 给定图Ｇ＝（Ｖ，Ｅ）．设ａ和ｂ是两个非负整数．是一个函数．如果对所有的均成立，称 ｆ为 Ｇ的一个分数［ａ，ｂ］－ 因子． ａ＝ ｂ＝ κ时，称ｆ为 Ｇ的一个分数 ｋ＝因子．本文给出了一个图有分数 ｋ－因子的充分必要条件．
|
| 关 键 词： | 因子 分数因子 增广路 |
FRACTIONAL k-FACTORS OF GRAPHS |
| |
| Lan Ju ZHANG.FRACTIONAL k-FACTORS OF GRAPHS[J].Journal of Systems Science and Mathematical Sciences,2001,21(1):088-092. |
| |
| Authors: | Lan Ju ZHANG |
| |
| Institution: | School of Mathematics and Systems Science, Shandong University, Jinan 250100,P.R.China |
| |
| 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: be a function. We call f a fractional a,b]-factor of G, if a 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: | Factors fractional factors augmenting path |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
