Jiancheng Wu

activity

20192025

most citedIndependence number and connectivity for fractional (a,b,k)-critical covered graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

6 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 $ρ (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,\ldo…

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…

math.CO2023

Two sufficient conditions for graphs to admit path factors

Sizhong Zhou, Jiancheng Wu

Let $A$ be a set of connected graphs. Then a spanning subgraph $A$ of $G$ is called an $A$ -factor if each component of $A$ is isomorphic to some member of $\mat…

math.CO2023

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 $λ_{1} (D (G))$ denote…

math.CO2019★ 1 cited

Independence number and connectivity for fractional (a,b,k)-critical covered graphs

Sizhong Zhou, Jiancheng Wu, Hongxia Liu

A graph $G$ is a fractional $(a, b, k)$ -critical covered graph if $G - U$ is a fractional $[a, b]$ -covered graph for every $U \subseteq V (G)$ with $∣ U ∣ = k$ , which is first defined by Zhou…