Tight Toughness, Isolated Toughness and Binding Number Bounds for the Star-Path Factor
-
Published:2023-10-20
Issue:
Volume:
Page:
-
ISSN:0219-2659
-
Container-title:Journal of Interconnection Networks
-
language:en
-
Short-container-title:J. Inter. Net.
Author:
Yao Yifan1,
Liang Jinxia1ORCID,
Li Yue1,
Ma Rongrong1
Affiliation:
1. School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, P. R. China
Abstract
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] 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.
Funder
Qinghai Key Laboratory of Internet of Things Project
Publisher
World Scientific Pub Co Pte Ltd
Subject
Computer Networks and Communications