科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let a, b and r be three nonnegative integers with 2 <= a <= b - r, let G be a graph of order p satisfying the inequality p(a + r) >= (a + b - 3)(2a + b + r) +1, and let g and f be two integer-valued functions defined on V (G) satisfying a <= g(x) <= f(x) - r <= b - r for every x is an element of V (G). A graph G is said to be fractional ID-(g, f) -factor -critical if G - I contains a fractional (g, f)-factor for every independent set I of G. In this paper, we prove that G is fractional ID-(g, f) -factor-critical if bind(G) ((a + r)p - (a + b 2)) > (2a + b + r - 1)(p - 1), which is a generalization of a previous result of Zhou.
