Sizhong Zhou

collaborators

2 papers

math.CO2026

Sufficient conditions for a special factor in a graph with minimum degree

Sizhong Zhou

Let $G$ be a graph. The size and the signless Laplacian spectral radius of $G$ are denoted by $e (G)$ and $q (G)$ , respectively. A spanning subgraph $F$ of $G$ is called an $H_{b}$ -fac…

math.CO2024

Spanning k-trees and distance spectral radius in graphs

Sizhong Zhou, Jiancheng Wu

Let $k \geq 2$ be an integer. A tree $T$ is called a $k$ -tree if $d_{T} (v) \leq k$ for each $v \in V (T)$ , that is, the maximum degree of a $k$ -tree is at most $k$ . Let $I^»_{1} (D (G))$ denot…