An Extension Result on Fractional ID-(g, F, M)-Deleted Graph.

A graph G is called a fractional ID-(g, f, m)-deleted graph if after deleting any independent-set I, the remaining graph G - I is a fractional (g, f, m)-deleted graph. In this paper, we give a binding number condition for a graph to be a fractional ID-(g, f, m)-deleted graph, which is a generalization of Zhou's previous conclusion published in Contributions to Discrete Mathematics.