On the Aα-spectral radius of graphs with given size. - Hongzhang Chen; Jianxi Li; Peng Huang (Discret. Appl. Math., 2023)

Spectral bounds for the zero forcing number of a graph. - Hongzhang Chen; Jianxi Li; Shou-Jun Xu (Discuss. Math. Graph Theory, 2024)

Spectral bounds for the vulnerability parameters of graphs. - Hongzhang Chen; Jianxi Li; Wai Chee Shiu (Comput. Appl. Math., 2024)

The size and the spectral radius of a saturated non-covered graph. - Zeyuan Wu; Hongzhang Chen; Jianxi Li (Discret. Appl. Math., 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)

Some results on the k-alliance and domination of graphs. - Hongzhang Chen; Jianxi Li; Bin Sun; Shou-Jun Xu (Discuss. Math. Graph Theory, 2025)

Two Variants of Toughness of a Graph and its Eigenvalues. - Hongzhang Chen; Jianxi Li; Shou-Jun Xu (Graphs Comb., 2025)