A RESULT ON FRACTIONAL k-DELETED GRAPHS

作者：Zhou, Sizhong^*

来源：Mathematica Scandinavica, 2010, 106(1): 99-106.

• EXISTENCE

Let k >= 2 be an integer, and let G be a graph of order n with n >= 4k - 5. A graph G is a fractional k-deleted graph if there exists a fractional k-factor after deleting any edge of G. The binding number of G is defined as
bind(G) = min {vertical bar N(G)(X)vertical bar/vertical bar X vertical bar : empty set not equal X subset of V (G), N(G)(X) not equal V (G)}.
In this paper, it is proved that if bind(G) > (2k-1)(n-1)/k(n-2), then G is a fractional k-deleted graph. Furthermore, it is shown that the result in this paper is best possible in some sense.

• 出版日期2010
• 单位江苏科技大学