Hong-xia Liu

collaborators

2 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

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$ ,…

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

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

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