Affiliation:
1. School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, P. R. China
Abstract
The [Formula: see text]-factor and [Formula: see text]-factor of a graph are a spanning subgraph whose each component is an element of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is a special family of trees. In this paper, we obtain a sufficient condition in terms of tight toughness, isolated toughness and binding number bounds to guarantee the existence of a [Formula: see text]-factor and [Formula: see text]-factor for any graph.
Funder
Qinghai Key Laboratory of Internet of Things Project
Publisher
World Scientific Pub Co Pte Ltd
Subject
Computer Networks and Communications