A graph G is called a fractional (g,f,n′,m)-critical deleted graph if after deleting any n′ vertices of G the remaining graph is a fractional (g,f,m)-deleted graph. In this paper, we give two binding number conditions for a graph to be a fractional (g,f,n′,m)-critical deleted graph.