Sizhong Zhou

activity

20242026

collaborators

15 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.CO2026

Spectral radius and perfect k-matchings in t-connected graphs

Quanru Pan, Sizhong Zhou

A $k$ -matching of a graph $G$ is a function $f : E (G) \to {0, 1, 2, \dots, k}$ with $e \in E_{G} (v) \sum f (e) \leq k$ for each vertex $v$ of $G$ , where $E_{G} (v)$ is the set o…

math.CO2026

Perfect matchings and $A_{I^} \pm$ -spectral radius in 1-binding graphs

Sizhong Zhou, Hongxia Liu

Let $G$ be a graph with vertex set $V (G)$ and edge set $E (G)$ . For $I^\pm \in [0, 1)$ , we use $A_{I^} \pm (G)$ and $I ¨ _{I^} \pm (G)$ to denote the $A_{I^} \pm$ -matrix and the $A_{I^} \pm$ -spectral radius of $G$ ,…

math.CO2026

Distance spectral radius and perfect matchings in graphs with given fractional property

Sizhong Zhou

A matching in a graph $G$ is a set of independent edges in $G$ . A perfect matching in a graph $G$ is a matching which saturates all the vertices of $G$ . A fractional perfect matchi…

math.CO2026

Spectral radii and star-factors with large components

Zhiren Sun, Sizhong Zhou

Let $G$ be a connected graph with $n$ vertices. The isolated toughness of $G$ , denoted by $I (G)$ , is defined by $I(G)=\min\left\{\frac{|S|}{i(G-S)}:S\subseteq V(G) \ \mbox{and} \ i…

math.CO2026

Toughness and AÎ±-spectral radius in graphs

Sizhong Zhou, Yuli Zhang, Tao Zhang +1

Let $I^\pm \in [0, 1)$ , and let $G$ be a connected graph of order $n$ with $n \geq f (I^\pm)$ , where $f (I^\pm) = 6$ for $I^\pm \in [0, \frac{2}{3}]$ and $f (I^\pm) = \frac{4}{1 - I ^ \pm}$ for $I^\pm \in (\frac{2}{3}, 1)$ …

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

Spectral radius and perfect k-matchings in t-connected graphs

Perfect matchings and AI^​±-spectral radius in 1-binding graphs

Distance spectral radius and perfect matchings in graphs with given fractional property

Spectral radii and star-factors with large components

Toughness and AÎ±-spectral radius in graphs

Perfect matchings and $A_{I^} \pm$ -spectral radius in 1-binding graphs