Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors

For a family of connected graphs F, a spanning subgraph L of G is called an F-factor if each component of L is isomorphic to a member of F. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the {P-2, C-3, P-5, T(3)}-factor, P-=2-factor or {P-2, C2i+1 | i = k}-factor for k = 3 are obtained.