Tight isolated toughness bound for fractional (a,b,m)-deleted graphs

A graph G is a fractional (a,b,m)-deleted graph if deleting any m edges from G, the resulting subgraph still admits a fractional [a,b]-factor. As an exclusive graph-based parameter, isolated toughness and its variant are utilized to measure the vulnerability of networks which are modelled by graph topology structures. Early studies have shown the inherent connection between isolated toughness and the existence of fractional factors in specific settings. This paper provides a theoretical perspective on the sufficient conditions for fractional (a,b,m)-deleted graphs with respect to isolated toughness and its variant. The sharpness of the given isolated toughness bounds is explained by counterexamples.