Key points are not available for this paper at this time.
Let G be a graph. A K 1, 2, K 1, 3, K 5 -factor of G is a spanning subgraph of G, in which every component is isomorphic to a member of K 1, 2, K 1, 3, K 5. In this paper, we establish a lower bound on the spectral radius of G to ensure that G contains a K 1, 2, K 1, 3, K 5 -factor.
Wang et al. (2024) studied this question.