Hongzhang Chen

According to our database, Hongzhang Chen authored at least 12 papers between 2023 and 2027.

Collaborative distances:

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

2027

An improved spectral lower bound for treewidth.

Hongzhang Chen, Zeyuan Wu, Jianxi Li

Inf. Process. Lett., 2027

2026

Maximizing the spectral radius of generalized cactus graphs.

Zeyuan Wu, Hongzhang Chen, Jianxi Li

RAIRO Oper. Res., 2026

Toughness, Hamiltonicity and eigenvalues of graphs.

Hongzhang Chen, Jianxi Li, Shou-Jun Xu

Discret. Math., 2026

Two kinds of polygonal chains with extremal Kemeny's constants.

Longjian Liao, Hongzhang Chen, Jianxi Li

Discret. Appl. Math., 2026

2025

Two Variants of Toughness of a Graph and its Eigenvalues.

Hongzhang Chen, Jianxi Li, Shou-Jun Xu

Graphs Comb., April, 2025

Conditions for <i>k</i>-factor-critical graphs.

Xiaoyun Lv, Hongzhang Chen, Jianxi Li, Shou-Jun Xu

RAIRO Oper. Res., 2025

Some results on the <i>k</i>-alliance and domination of graphs.

Hongzhang Chen, Jianxi Li, Bin Sun, Shou-Jun Xu

Discuss. Math. Graph Theory, 2025

Sufficient conditions for spanning trees with constrained leaf distance in a graph.

Hongzhang Chen, Xiaoyun Lv, Jianxi Li, Shou-Jun Xu

Discuss. Math. Graph Theory, 2025

The size and the spectral radius of a saturated non-covered graph.

Zeyuan Wu, Hongzhang Chen, Jianxi Li

Discret. Appl. Math., 2025

2024

Spectral bounds for the vulnerability parameters of graphs.

Hongzhang Chen, Jianxi Li, Wai Chee Shiu

Comput. Appl. Math., March, 2024

Spectral bounds for the zero forcing number of a graph.

Hongzhang Chen, Jianxi Li, Shou-Jun Xu

Discuss. Math. Graph Theory, 2024

2023

On the Aα-spectral radius of graphs with given size.

Hongzhang Chen, Jianxi Li, Peng Huang

Discret. Appl. Math., December, 2023