Binding number and minimum degree for fractional ID-k-factor-critical graphs

作者：Zhou, Sizhong^*

来源：Utilitas Mathematica, 2016, 99: 273-280.

• graph
• fractional k-factor
• fractional ID-k-factor-critical graph
• binding number
• minimum degree

Let k >= 2 be an integer, and let G be a graph of order n. Let h : E(G) -> [0,1] be a function. If Sigma e(sic)x h(e) = k holds for any x is an element of V(G), then we call G[F-h] a fractional k-factor of G with indicator function h where F-h = {e is an element of E(G) : h(e) > 0}. A graph G is fractional independent-set-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. In this paper, we prove that if G satisfies n >= 7k -15 + 6/k, bind (G) >= 2 + k-1/k and delta(G) > (2k-1)n+2k-2/3k-1, then G is fractional ID-k-factor-critical. The result is an extension of Zhou's previous result.

• 出版日期2016-3
• 单位江苏科技大学