Year: 2024
Type: preprint
Abstract: A graph $G$ contains a strong parity factor $F$ if for every subset $X\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $δ(F)\geq1$, $d_F(u)\equiv1$ (mod 2) for any $u\in X$, and $d_F(v)\equiv0$ (mod 2) for any $v\in V(G)\setminus X$. In this paper, we give a spectral radius condition to guarantee that a connected graph contains a strong parity factor.
Source: arXiv (Cornell University)
Authors: Zhou, Sizhong, Zhang, Tao, Bian, Qiuxiang
Institution: Jiangsu University of Science and Technology
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: G3829033658
OpenAlex ID: W4392089902