The existence of a $\{P_2,C_3,P_5,\mathcal{T}(3)\}$-factor based on the size or the $A_{\hat{I}}\pm$-spectral radius of graphs

Xianglong Zhang, Lihua You

Let $G$ be a connected graph of order $n$. A $\{P_2,C_3,P_5,\mathcal{T}(3)\}$-factor of $G$ is a spanning subgraph of $G$ such that each component is isomorphic to a member i…