Sizhong Zhou

According to our database, Sizhong Zhou authored at least 65 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Spectral radius and component factors in graphs.

Sizhong Zhou

J. Supercomput., January, 2025

A spectral condition for a graph to have strong parity factors.

Sizhong Zhou, Tao Zhang, Qiuxiang Bian

Discret. Appl. Math., 2025

2024

Spanning k-trees and distance spectral radius in graphs.

Sizhong Zhou, Jiancheng Wu

J. Supercomput., November, 2024

Some existence theorems on path-factor critical avoidable graphs.

Sizhong Zhou, Hongxia Liu

RAIRO Oper. Res., 2024

Two Sufficient Conditions for Graphs to Admit Path Factors.

Sizhong Zhou, Jiancheng Wu

Fundam. Informaticae, 2024

The A-spectral radius for path-factors in graphs.

Sizhong Zhou, Yuli Zhang, Zhiren Sun

Discret. Math., 2024

D-index and Q-index for spanning trees with leaf degree at most k in graphs.

Sizhong Zhou, Zhiren Sun, Hongxia Liu

Discret. Math., 2024

Spanning k-trees and distance signless Laplacian spectral radius of graphs.

Sizhong Zhou, Yuli Zhang, Hongxia Liu

Discret. Appl. Math., 2024

Remarks on restricted fractional (g,f)-factors in graphs.

Sizhong Zhou

Discret. Appl. Math., 2024

2023

Sufficient conditions for graphs to have strong parity factors.

Sizhong Zhou, Yuli Zhang

RAIRO Oper. Res., September, 2023

Characterizing an odd [1, <i>b</i>]-factor on the distance signless Laplacian spectral radius.

Sizhong Zhou, Hongxia Liu

RAIRO Oper. Res., May, 2023

Two sufficient conditions for component factors in graphs.

Sizhong Zhou, Qiuxiang Bian, Zhiren Sun

Discuss. Math. Graph Theory, 2023

Some results on path-factor critical avoidable graphs.

Sizhong Zhou

Discuss. Math. Graph Theory, 2023

2022

Independence number and connectivity for fractional (<i>a</i>, <i>b</i>, <i>k</i>)-critical covered graphs.

Sizhong Zhou, Jiancheng Wu, Hongxia Liu

RAIRO Oper. Res., 2022

The existence of path-factor uniform graphs with large connectivity.

Sizhong Zhou, Qiuxiang Bian

RAIRO Oper. Res., 2022

A Note of Generalization of Fractional ID-factor-critical Graphs.

Sizhong Zhou

Fundam. Informaticae, 2022

Nowhere-zero unoriented 6-flows on certain triangular graphs.

Fan Yang, Liangchen Li, Sizhong Zhou

Discuss. Math. Graph Theory, 2022

A note on fractional ID-[a, b]-factor-critical covered graphs.

Sizhong Zhou, Hongxia Liu, Yang Xu

Discret. Appl. Math., 2022

Path factors in subgraphs.

Sizhong Zhou, Qiuxiang Bian, Quanru Pan

Discret. Appl. Math., 2022

A neighborhood union condition for fractional (a, b, k)-critical covered graphs.

Sizhong Zhou

Discret. Appl. Math., 2022

2021

Isolated toughness and path-factor uniform graphs.

Sizhong Zhou, Zhiren Sun, Hongxia Liu

RAIRO Oper. Res., 2021

Binding numbers and restricted fractional (g, f)-factors in graphs.

Sizhong Zhou

Discret. Appl. Math., 2021

A neighborhood condition for graphs to have restricted fractional (g, f)-factors.

Sizhong Zhou, Zhiren Sun

Contributions Discret. Math., 2021

2020

Remarks on path factors in graphs.

Sizhong Zhou

RAIRO Oper. Res., 2020

A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs.

Sizhong Zhou, Zhiren Sun, Q. Pan

Probl. Inf. Transm., 2020

Sample sizes and population differences in brain template construction.

Guoyuan Yang, Sizhong Zhou, Jelena Bozek, Hao-Ming Dong, Meizhen Han, Xi-Nian Zuo, Hesheng Liu, Jia-Hong Gao

NeuroImage, 2020

Binding number conditions for P≥2-factor and P≥3-factor uniform graphs.

Sizhong Zhou, Zhiren Sun

Discret. Math., 2020

Subgraphs with orthogonal factorizations in graphs.

Sizhong Zhou, Tao Zhang, Zurun Xu

Discret. Appl. Math., 2020

2019

Some results about component factors in graphs.

Sizhong Zhou

RAIRO Oper. Res., 2019

Degree conditions for fractional (<i>a</i>, <i>b</i>, <i>k</i>)-critical covered graphs.

Sizhong Zhou, Yang Xu, Zhiren Sun

Inf. Process. Lett., 2019

Sun toughness and P_≥3-factors in graphs.

Sizhong Zhou

Contributions Discret. Math., 2019

2018

A generalization of orthogonal factorizations in digraphs.

Zhiren Sun, Sizhong Zhou

Inf. Process. Lett., 2018

2017

A result on r-orthogonal factorizations in digraphs.

Sizhong Zhou, Zhiren Sun, Zurun Xu

Eur. J. Comb., 2017

The existence of <i>P_≥3</i>-factor covered graphs.

Jiancheng Wu, Tao Zhang, Sizhong Zhou

Discuss. Math. Graph Theory, 2017

Toughness for the existence of k-Hamiltonian [a, b]-factors.

Sizhong Zhou, Yang Xu, Fan Yang

Ars Comb., 2017

Subgraphs with Orthogonal [0, k_i]_1ⁿ -Factorizations in Graphs.

Sizhong Zhou, Tao Zhang, Zurun Xu

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

Stability Number and k-Hamiltonian [a, b]-factors.

Sizhong Zhou, Yang Xu, Lan Xu

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

A neighborhood condition for fractional ID-[<i>a, b</i>]-factor-critical graphs.

Zhiren Sun, Fan Yang, Sizhong Zhou

Discuss. Math. Graph Theory, 2016

2015

An existence theorem on fractional deleted graphs.

Sizhong Zhou, Qiuxiang Bian

Period. Math. Hung., 2015

A theorem on fractional ID-(g, f)-factor-critical graphs.

Sizhong Zhou, Zhiren Sun, Yang Xu

Contributions Discret. Math., 2015

A new sufficient condition for graphs to be (a, b, k)-critical graphs.

Sizhong Zhou

Ars Comb., 2015

Degree Conditions for Graphs to Be Fractional k-Covered Graphs.

Sizhong Zhou

Ars Comb., 2015

2014

Remarks on orthogonal factorizations of digraphs.

Sizhong Zhou

Int. J. Comput. Math., 2014

Subdigraphs with orthogonal factorizations of digraphs (II).

Sizhong Zhou, Qiuju Bian

Eur. J. Comb., 2014

[a, b]-factors With Given Edges In Graphs.

Sizhong Zhou

Ars Comb., 2014

A result on fractional ID-[a, b]-factor-critical graphs.

Sizhong Zhou, Jie Wu, Quanru Pan

Australas. J Comb., 2014

2013

A toughness condition for fractional (<i>k</i>, <i>m</i>)-deleted graphs.

Sizhong Zhou, Zhiren Sun, Hui Ye

Inf. Process. Lett., 2013

Stability number and Minimum Degree for (a, B, k)-Critical graphs.

Sizhong Zhou, Yang Xu, Jiancheng Wu

Discret. Math. Algorithms Appl., 2013

Isolated Toughness and Fractional (g, f)-Factors of Graphs.

Sizhong Zhou, Ziming Duan, Bingyuan Pu

Ars Comb., 2013

Minimum Degree, Independence Number and (a, b, k)-Critical Graphs.

Sizhong Zhou

Ars Comb., 2013

2012

A Degree Condition for Graphs to Have (g, f)-Factors.

Sizhong Zhou, Bingyuan Pu

Ars Comb., 2012

A New Sufficient Condition for Graphs to Have (g, f)-Factors.

Sizhong Zhou, Jiashang Jiang

Ars Comb., 2012

Orthogonal (g, f)-Factorization in Graphs.

Sizhong Zhou

Ars Comb., 2012

A new neighborhood condition for graphs to be fractional (k, m)-deleted graphs.

Sizhong Zhou

Appl. Math. Lett., 2012

2011

Toughness and (a, b, k)-critical graphs.

Sizhong Zhou, Jiashang Jiang

Inf. Process. Lett., 2011

Some new sufficient conditions for graphs to have fractional <i>k</i>-factors.

Sizhong Zhou

Int. J. Comput. Math., 2011

Some New Sufficient Conditions for Graphs to be (a, b, k)-Critical Graphs.

Sizhong Zhou, Zurun Xu, Minggang Zong

Ars Comb., 2011

Binding Number and Fractional k-Factors of Graphs.

Sizhong Zhou, Zurun Xu, Ziming Duan

Ars Comb., 2011

A sufficient condition for graphs to be fractional (k, m)-deleted graphs.

Sizhong Zhou

Appl. Math. Lett., 2011

2010

A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph.

Sizhong Zhou

Int. J. Comput. Math., 2010

Randomly r-Orthogonal (0, f)-Factorizations of Bipartite (0, mf-(m-1)r)-Graphs.

Sizhong Zhou

Ars Comb., 2010

2009

On fractional (f, n)-critical graphs.

Sizhong Zhou, Qiqing Shen

Inf. Process. Lett., 2009

Independence number, connectivity and (a, b, k)-critical graphs.

Sizhong Zhou

Discret. Math., 2009

2007

Complete-factors and (g, f)-covered graphs.

Sizhong Zhou, Xiuqian Xuan

Australas. J Comb., 2007

Randomly r-orthogonal (0, f)-factorizations of (0, mf-m+1)-graphs.

Sizhong Zhou

Australas. J Comb., 2007