activity
20172026
most citedThe signless Laplacian spectral radius of graphs without intersecting odd cycles

5 citations · 7 across the 11 of their papers we have counts for

collaborators
Showing math.COShow all

13 papers · 1 filter

math.CO2026

Turán extremal graphs vs. Signless Laplacian spectral Turán extremal graphs

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

Let be a graph with chromatic number . Denote by and the Turán number and the set of all extremal graphs for , respectively. In addition, $…

math.CO2023

The spectral radius of minor free graphs

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

In this paper, we present a sharp upper bound for the spectral radius of an -vertex graph without -minor for sufficient large , where is obtained from the complete gra…

math.CO2023

On the -spectral radius of graphs without linear forests

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

Let and be the adjacency and degree matrices of a simple graph on vertices, respectively. The \emph{-spectral radius} of is the largest eigenvalue of…

math.CO2022

The signless Laplacian spectral radius of graphs without trees

Ming-Zhu Chen, Zhao-Ming Li, Xiao-Dong Zhang

Let be the signless Laplacian matrix of a simple graph of order , where and are the degree diagonal matrix and the adjacency matrix of , respec…

math.CO2022

Spectral extremal results on the -index of graphs without minors and star forests

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

Let be a graph of order , and let and be the adjacency matrix and the degree matrix of respectively. Define the convex linear combinations of $A (…

math.CO2022

The bipartite Turan number and spectral extremum for linear forests

Ming-Zhu Chen, Ning Wang, Long-Tu Yuan +1

The bipartite Turán number of a graph , denoted by , is the maximum number of edges in any bipartite graph with and which does not conta…