Hongxia Liu

collaborators

2 papers

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

math.CO2024

A spectral condition for spanning trees with restricted degrees in bipartite graphs

Jiancheng Wu, Sizhong Zhou, Hongxia Liu

Let $G$ be a graph and $T$ be a spanning tree of $G$ . We use $Q (G) = D (G) + A (G)$ to denote the signless Laplacian matrix of $G$ , where $D (G)$ is the diagonal degree matrix of $G$ and…