摘要
一个图称为分数 (g ,f) 因子消去图 ,如果去掉图G中的任何一条边e图G仍有一个分数 (g ,f) 因子 .本文分别给出了一个图是分数 1 因子消去图和分数 2 因子消去图的几个充分条件 .并给出一个图有一个分数 (g ,f) 因子不含给定对集中任何一条边的充要条件 .
A graph G is fractional (g,f)-deleted if deleting any edge of G,there exists a fractional (g,f)-factor.In this paper,we give some sufficient conditions for a graph to be fractional 1-deleted and fractional 2-deleted.We also give a necessary and sufficient condition for a graph to have a fractional (g,f)-factor excluding any edge of a maching.
出处
《应用数学》
CSCD
北大核心
2003年第1期148-154,共7页
Mathematica Applicata
基金
ResearchsupportedbytheNationalNaturalScienceFoundationofChina
byNational 973FundamentalResearchProjectofChinaon"AppliedTheoryandHigh PerformanceSoftwareforIT"(60 0 0 2 0 0 1)
