Jiancheng Wu

collaborators

3 papers

math.CO2025

Sufficient conditions for even factors in graphs

Sizhong Zhou, Qiuxiang Bian, Jiancheng Wu

Let $G$ be a graph. We denote by $e (G)$ and $I ¨ (G)$ the size and the spectral radius of $G$ . A spanning subgraph $F$ of $G$ is called an even factor of $G$ if $d_F(v)\in\{2,4,6,\ld…

math.CO2025

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs

Jiancheng Wu, Sizhong Zhou

The binding number of a graph $G$ , written as $\mbox{bind}(G)$, is defined by $$ \mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\…

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…