Back to Search
Start Over
Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors.
- Source :
- Journal of Interconnection Networks; Jun2024, Vol. 24 Issue 2, p1-14, 14p
- Publication Year :
- 2024
-
Abstract
- For a family of connected graphs ℱ , a spanning subgraph L of G is called an ℱ -factor if each component of L is isomorphic to a member of ℱ. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the { P 2 , C 3 , P 5 , (3) } -factor, P ≥ 2 -factor or { P 2 , C 2 i + 1 | i ≥ k } -factor for k ≥ 3 are obtained. [ABSTRACT FROM AUTHOR]
- Subjects :
- GRAPH connectivity
SPANNING trees
Subjects
Details
- Language :
- English
- ISSN :
- 02192659
- Volume :
- 24
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Journal of Interconnection Networks
- Publication Type :
- Academic Journal
- Accession number :
- 177608712
- Full Text :
- https://doi.org/10.1142/S0219265923500135