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
Showing math.COShow all

6 papers · 1 filter

math.CO2025

Sufficient conditions for even factors in graphs

Sizhong Zhou, Qiuxiang Bian, Jiancheng Wu

Let be a graph. We denote by and the size and the spectral radius of . A spanning subgraph of is called an even factor of 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 , 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 be a graph and be a spanning tree of . We use to denote the signless Laplacian matrix of , where is the diagonal degree matrix of and…

math.CO2023

Two sufficient conditions for graphs to admit path factors

Sizhong Zhou, Jiancheng Wu

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

math.CO2023

Spanning k-trees and distance spectral radius in graphs

Sizhong Zhou, Jiancheng Wu

Let be an integer. A tree is called a -tree if for each , that is, the maximum degree of a -tree is at most . Let 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 is a fractional -critical covered graph if is a fractional -covered graph for every with , which is first defined by Zhou…