Toughness and Fractional(k,n′)-critical Deleted Graphs
Wei Dong Gao · Journal of Shanxi University · 2012
A graph G is called a fractional(k,n′)-critical deleted graph,if after deleting any n′ vertices of G the remaining graph is a fractional k-deleted graph.We prove that if t(G)≥((k2-1)(n′+1))/k and nk+n′+1,then G is a fractional(k,n′)-critical deleted graph.