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

Abstract

For a family of connected graphs [Formula: see text], a spanning subgraph [Formula: see text] of [Formula: see text] is called an [Formula: see text]-factor if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor, [Formula: see text]-factor or [Formula: see text]-factor for [Formula: see text] are obtained.