Tight toughness, isolated toughness and binding number bounds for the path factors

Abstract

For a set of connected subgraphs, an -factor denotes a spanning subgraph D of G if each component of D 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 -factor and -factor for a graph are obtained.