Qiuxiang Bian

activity

20242026

collaborators

4 papers

math.CO2026

The existence of odd-even factors in 1-binding graphs

Sizhong Zhou, Qiuxiang Bian, Hongxia Liu

Let $G$ be a graph. The binding number of $G$ , denoted by $\mbox{bind}(G)$, is defined as $$ \mbox{bind}(G)=\min\left\{\frac{|N_G(S)|}{|S|}:\emptyset\neq S\subseteq V(G) \ \mbox{an…

math.CO2025

Sufficient conditions for even factors in graphs

Sizhong Zhou, Qiuxiang Bian, Jiancheng Wu

Let $G$ be a graph. We denote by $e (G)$ and $ρ (G)$ the size and the spectral radius of $G$ . A spanning subgraph $F$ of $G$ is called an even factor of $G$ if $d_F(v)\in\{2,4,6,\ldo…

math.CO2024

Aα-spectral radius and path-factor covered graphs

Sizhong Zhou, Hongxia Liu, Qiuxiang Bian

Let $α \in [0, 1)$ , and let $G$ be a connected graph of order $n$ with $n \geq f (α)$ , where $f (α) = 14$ for $α \in [0, \frac{1}{2}]$ , $f (α) = 17$ for $α \in (\frac{1}{2}, \frac{2}{3}]$ , $f(α)=20…

math.CO2024

A spectral condition for a graph having a strong parity factor

Sizhong Zhou, Tao Zhang, Qiuxiang Bian

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) \geq 1$ , $d_{F} (u) \equiv 1$ (mod…