A degree condition for the existence of k-factors
Journal of Graph Theory
Graph Theory With Applications
Graph Theory With Applications
On toughness and fractional (g,f,n )-critical graphs
Information Processing Letters
Hi-index | 0.89 |
Let G be a graph of order p, and let a,b and n be nonnegative integers with b=a=2, and let f be an integer-valued function defined on V(G) such that a=X@?V(G),N"G(X)V(G)}. In this paper, it is proved that G is a fractional (f,n)-critical graph if bind(G)(a+b-1)(p-1)(ap-(a+b)-bn+2) and p=(a+b)(a+b-3)a+bn(a-1). Furthermore, it is showed that the result in this paper is best possible in some sense.