The existence of a \(\{ K_{1, 2}, K_{1, 3}, K_5 \}\)-factor based on the size or the \(A_\alpha \)-spectral radius of graphs (Q6930356)

Let \(G\) be a graph with adjacency matrix \(A(G)\), and let \(D(G)\) denote the diagonal matrix of the degrees of \(G\). \textit{V. Nikiforov} [Appl. Anal. Discrete Math. 11, No. 1, 81--107 (2017; Zbl 1499.05384)] introduced a unifying framework for the adjacency matrix \(A(G)\) and the signless Laplacian \(Q(G)\) by considering the convex linear combination\N\[\NA_\alpha(G) = \alpha D(G) + (1-\alpha)A(G), \quad 0 \leq \alpha \leq 1.\N\]\NIn the present paper, the authors establish two distinct sufficient conditions, one in terms of the number of edges and the other in terms of the \(A_\alpha\)-spectral radius, that guarantee a connected graph admits a \(\{K_{1,2}, K_{1,3}, K_{5}\}\)-factor.