Ming-Zhu Chen

According to our database, Ming-Zhu Chen authored at least 11 papers between 2017 and 2026.

Collaborative distances:

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

2026

Spectral extrema of graphs: Forbidden cliques and star forests.

Ming-Zhu Chen, Ya-Lei Jin, Peng-Li Zhang

Discret. Math., 2026

Spectral extrema of graphs: Forbidden linear forests and non-bipartite graphs.

Xuelian Mao, Zhenyu Ni, Ming-Zhu Chen

Discret. Appl. Math., 2026

2025

The signless Laplacian spectral radius of book-free graphs.

Ming-Zhu Chen, Ya-Lei Jin, Peng-Li Zhang

Discret. Math., 2025

2024

The spectral radius of minor-free graphs.

Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang

Eur. J. Comb., 2024

2023

On the Aα-spectral radius of graphs without linear forests.

Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang

Appl. Math. Comput., August, 2023

An Aα-Spectral Erdős-Sós Theorem.

Ming-Zhu Chen, Shuchao Li, Zhao-Ming Li, Yuantian Yu, Xiao-Dong Zhang

Electron. J. Comb., 2023

2021

On the spectral radius of graphs without a star forest.

Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang

Discret. Math., 2021

2019

Spectral Extremal Results with Forbidding Linear Forests.

Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang

Graphs Comb., 2019

Erdős-Gallai stability theorem for linear forests.

Ming-Zhu Chen, Xiao-Dong Zhang

Discret. Math., 2019

2018

The number of edges, spectral radius and Hamilton-connectedness of graphs.

Ming-Zhu Chen, Xiao-Dong Zhang

J. Comb. Optim., 2018

2017

On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices.

Ming-Zhu Chen, Bo Zhou

Appl. Math. Comput., 2017