Tight Toughness, Isolated Toughness and Binding Number Bounds for the Star-Path Factor
Yifan Yao, Jinxia Liang, Yue Li, Rongrong Ma · Journal of Interconnection Networks · 2023
For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of [Formula: see text] is called a [Formula: see text]-factor if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor and [Formula: see text]-factor for any graph are obtained.