A spectral condition for component factors in graphs

Abstract

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.