Wenqian Zhang

According to our database, Wenqian Zhang authored at least 13 papers between 2019 and 2025.

Collaborative distances:

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

2025

A spectral condition for Hamilton cycles in tough bipartite graphs.

Lianyang Ai, Wenqian Zhang

Graphs Comb., December, 2025

2024

The Spectral Radius, Maximum Average Degree and Cycles of Consecutive Lengths of Graphs.

Wenqian Zhang

Graphs Comb., April, 2024

Spectral extrema of 1-planar graphs.

Wenqian Zhang, Jianfeng Wang, Weifan Wang

Discret. Math., 2024

The spectral radius and k-power of Hamilton cycle of graphs.

Wenqian Zhang

Discret. Math., 2024

2022

The Spectral Radius and ${\mathcal {P}}_{\ge \ell }$-Factors of Graphs Involving Minimum Degree.

Wenqian Zhang

Graphs Comb., 2022

The maximum spectral radius of <i>t</i>-connected graphs with bounded matching number.

Wenqian Zhang

Discret. Math., 2022

On the Zero Forcing Number and Spectral Radius of Graphs.

Wenqian Zhang, Jianfeng Wang, Weifan Wang, Shengjin Ji

Electron. J. Comb., 2022

2021

A New Result on Spectral Radius and Maximum Degree of Irregular Graphs.

Wenqian Zhang

Graphs Comb., 2021

A Note on Spectral Radius and Maximum Degree of Irregular Graphs.

Rongquan Feng, Wenqian Zhang

Graphs Comb., 2021

A note on spectral radius and degree deviation in graphs.

Wenqian Zhang

Discret. Math., 2021

2020

Matching Extendability and Connectivity of Regular Graphs from Eigenvalues.

Wenqian Zhang

Graphs Comb., 2020

The Edge-Connectivity of Strongly 3-Walk-Regular Graphs.

Rongquan Feng, Wenqian Zhang

Graphs Comb., 2020

2019

The Cyclic Edge-Connectivity of Strongly Regular Graphs.

Wenqian Zhang

Graphs Comb., 2019