期刊论文

Li, Shuchao(lscmath@ccnu.edu.cn)

英文

Discrete Applied Mathematics

0166-218X

2023

326

17-32

10.1016/j.dam.2022.11.006

The authors are grateful to the anonymous referee for his/her kind and professional suggestions which have improved the presentation of the paper. This research was supported by the National Natural Science Foundation of China (Grant Nos. 12171190 , 11671164 ), the Natural Science Foundation of Jiangxi, PR China (Grant No. 20202BABL201010 ) and the Graduate Innovation and Entrepreneurship Grant from Central China Normal University (Grant No. S202210511031 ).

本校为第一机构

Let G be a graph and let k 2 be an integer. A {K1,j : 1 S j S k}-factor of G is a spanning subgraph of G, in which each component is isomorphic to a member in {K1,j : 1 S j S k}. In this paper, we first establish a lower bound on the size (resp. the spectral radius) of G to guarantee that G contains a {K1,j : 1 S j S k}-factor. Then we determine an upper bound on the distance spectral radius of G to ensure that G has a {K1,j : 1 S j S k}-factor. Furthermore, we construct some extremal graphs to show all the bounds obtained in this cont...