Hongxia Liu

collaborators

3 papers

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…

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

Toughness and Aα-spectral radius in graphs

Sizhong Zhou, Yuli Zhang, Tao Zhang +1

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