Key points are not available for this paper at this time.
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.
Sizhong Zhou (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: