For a set of connected graphs, a spanning subgraph H of G is called a -factor if each component of H is isomorphic to a member of . In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the { K 1 , j : 1 ≤ j ≤ 2 k } -factor and { P 2 , P 5 } -factor for any graph are obtained. [ABSTRACT FROM AUTHOR]