A tight neighborhood union condition on fractional $(g,f,n’,m)$-critical deleted graphs

A graph G is called a fractional $(g,f,n’,m)$-critical deleted graph if it remains a fractional $(g,f,m)$-deleted graph after deleting any $n’$ vertices. We prove that if G is a graph of order n, 1≤ a≤ g(x)≤ f(x)≤ b for any x∈ V(G), $\