摘要
一个图称为分数(g,f)-因子覆盖图,如果图G中的任何一条边e都包含在 一个分数(g,f)-因子中,并且满足h(e)=1,其中h是分数(g,f)-因子的导出函数。本文 给出了一个图是分数(g,f)-因子覆盖图的充要条件.
A graph G is fractional (g,f)-covered if each edge e of G belongs to a fractional (g,f)-factor, such that h(e) = 1, where h is the indicator function of fractional (g,f)-factor. In this paper, a necessary and sufficient condition for a graph to be fractional (g, f)- covered is given.
出处
《运筹学学报》
CSCD
北大核心
2002年第4期65-68,共4页
Operations Research Transactions
基金
ResearchsupportedbytheNationalNaturalScienceFoundationofChinaandbyNational973Funda-mentalResearchProjectofChinaon"AppliedTheoryandHigh-PerformanceSoftwareforIT".