In this paper, we present the relationship between toughness and fractional critical deleted graphs. It is determined that G is fractional (g, f, n)-critical deleted if t(G) >= b(2)-Delta-1+bn/a, where 1 <= a <= b, b >= 2 and (a, b) not equal (1, 2). Furthermore, we derive a toughness bound for fractional (a, b, n)-critical deleted graphs. These results expand previous results published in The Scientific World Journal and Ars Combinatoria, respectively.