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

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

collaborators

10 papers

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…

math.CO20215 cited

The signless Laplacian spectral radius of graphs without intersecting odd cycles

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

Let be a graph consisting of cycles of odd length , respectively which intersect in exactly a common vertex, where and $a_1\g…

math.CO2021

On the spectral radius of graphs without a star forest

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

In this paper, we present two sharp upper bounds for the spectral radius of (bipartite) graphs with forbidden a star forest and characterize all extremal graphs. Moreover, the mini…

math.CO2020

The signless Laplacian spectral radius of graphs with forbidding linear forests

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

Turán type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Turán type extremal problem i…