摘要
给定图G=(V,E).设a和b是两个非负整数.是一个函数.如果对所有的均成立,称 f为 G的一个分数[a,b]- 因子. a= b= κ时,称f为 G的一个分数 k=因子.本文给出了一个图有分数 k-因子的充分必要条件.
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.
出处
《系统科学与数学》
CSCD
北大核心
2001年第1期88-92,共5页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金
博士点基金