LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical（in short,fractional ID-k-factor-critical）,if G I has a fractional k-factor for every independent set ...LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical（in short,fractional ID-k-factor-critical）,if G I has a fractional k-factor for every independent set I of G.The binding number bind（G）of a graph G is defined as bind（G）=min｜NG（X）｜｜X｜：=X V（G）,NG（X）=V（G）.In this paper,it is proved that a graph G is fractional ID-k-factor-critical if n≥6k 9 and bind（G）〉（3k 1）（n 1）kn 2k＋2.展开更多
基金Supported by Natural Science Foundation of the Higher Education Institutions of Jiangsu Province(Grant No.10KJB110003)Jiangsu University of Science and Technology(Grant No.2010SL101J)+1 种基金National Natural Science Foundation of China(Grant No.71271119)National Social Science Foundation of China(Grant No.11BGL039)
文摘LetG be a graph,and k≥2 be a positive integer.A graph G is fractional independentset-deletable k-factor-critical（in short,fractional ID-k-factor-critical）,if G I has a fractional k-factor for every independent set I of G.The binding number bind（G）of a graph G is defined as bind（G）=min｜NG（X）｜｜X｜：=X V（G）,NG（X）=V（G）.In this paper,it is proved that a graph G is fractional ID-k-factor-critical if n≥6k 9 and bind（G）〉（3k 1）（n 1）kn 2k＋2.
