Abstract
For a family of connected graphs ℱ, a spanning subgraph H of a graph G is called an ℱ-factor of G if its each component is isomorphic to an element of ℱ. In particular, H is called an Sk-factor of G if ℱ = {K1,1, K1,2,…,K1,k}, where integer k ≥ 2; H is called a P≥3-factor of G if every component in ℱ is a path of order at least three. As an extension of Sk-factors, the induced star-factor (i.e., ISk-factor) is a spanning subgraph each component of which is an induced subgraph isomorphic to some graph in ℱ = {K1,1, K1,2,…,K1,k}. In this paper, we firstly prove that a graph G has an Sk-factor if and only if its isolated toughness I(G) ≥ 1/k. Secondly, we prove that a planar graphs G has an S2-factors if its minimum degree δ(G) ≥ 3. Thirdly, we give two sufficient conditions for graphs with ISk-factors by toughness and minimum degree, respectively. Additionally, we obtain three special classes of graphs admitting P≥3-factors.
Funder
National Natural Science Foundation of China
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Some Existence Theorems on Star Factors;Journal of Interconnection Networks;2023-11-29
2. Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors;Journal of Interconnection Networks;2023-07-27
3. Degree sum and restricted {P2,P5}-factor in graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-06-28
4. Degree sum conditions for path-factor uniform graphs;Indian Journal of Pure and Applied Mathematics;2023-06-19
5. Tight toughness, isolated toughness and binding number bounds for the path factors;International Journal of Computer Mathematics: Computer Systems Theory;2023-06-01