A spectral condition for a graph having a strong parity factor

A graph G contains a strong parity factor F if for every subset X⊆ V(G) with $|X|$ even, G has a spanning subgraph F satisfying δ(F)≥1, dF(u)≡1 (mod 2) for any u∈ X, and dF(v)≡0 (mod 2) for any v∈ V(G) X. In this paper, we give a spectral radius condition to guarantee that a connected graph contains a strong parity factor.