Ming-Zhu Chen

activity

20172026

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

5 citations · 9 across the 14 of their papers we have counts for

collaborators

14 papers

math.CO2026

A solution to a conjecture on the signless Laplacian spectral radius for $t$ -color-critical graphs

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

An induced matching is a matching that forms an induced subgraph. A graph is $t$ -color-critical if removing some induced matching of size $t$ lowers its chromatic number, but remov…

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 $F$ be a graph with chromatic number $χ (F) = r + 1$ . Denote by $e x (n, F)$ and $E x (n, F)$ the Turán number and the set of all extremal graphs for $F$ , 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 $n$ -vertex graph without $F$ -minor for sufficient large $n$ , where $F$ is obtained from the complete gra…

math.CO2023

On the $A_{α}$ -spectral radius of graphs without linear forests

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

Let $A (G)$ and $D (G)$ be the adjacency and degree matrices of a simple graph $G$ on $n$ vertices, respectively. The \emph{ $A_{α}$ -spectral radius} of $G$ 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 $Q (G) = D (G) + A (G)$ be the signless Laplacian matrix of a simple graph of order $n$ , where $D (G)$ and $A (G)$ are the degree diagonal matrix and the adjacency matrix of $G$ , 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 $G$ be a graph of order $n$ , and let $A (G)$ and $D (G)$ be the adjacency matrix and the degree matrix of $G$ respectively. Define the convex linear combinations $A_{α} (G)$ 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 $H$ , denoted by $e x (m, n; H)$ , is the maximum number of edges in any bipartite graph $G = (X, Y; E)$ with $∣ X ∣ = m$ and $∣ Y ∣ = n$ which does not conta…

math.CO2021★ 5 cited

The signless Laplacian spectral radius of graphs without intersecting odd cycles

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

Let $F_{a_{1}, \dots, a_{k}}$ be a graph consisting of $k$ cycles of odd length $2 a_{1} + 1, \dots, 2 a_{k} + 1$ , respectively which intersect in exactly a common vertex, where $k \geq 1$ 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…

math.CO2019★ 2 cited

On the signless Laplacian spectral radius of $K_{s, t}$ -minor free graphs

Ming-Zhu Chen, Xiao-Dong Zhang

In this paper, we prove that if $G$ is a $K_{2, t}$ -minor free graph of order $n \geq t^{2} + 4 t + 1$ with $t \geq 3$ , the signless Laplacian spectral radius $q(G)\leq \frac{1}{2}(n+2t-2+\s…

math.CO2019

Erdos-Gallai Stability Theorem for Linear Forests

Ming-Zhu Chen, Xiao-Dong Zhang

The Erdős-Gallai Theorem states that every graph of average degree more than $l - 2$ contains a path of order $l$ for $l \geq 2$ . In this paper, we obtain a stability version of the Er…

math.CO2018★ 2 cited

Spectral extremal results with forbidding linear forests

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

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

math.CO2017

Some new sufficient conditions for $2 p$ -Hamilton-biconnectedness of graphs

Ming-Zhu Chen, Xiao-Dong Zhang

A balanced bipartite graph $G$ is said to be $2 p$ -Hamilton-biconnected if for any balanced subset $W$ of size $2 p$ of $V (G)$ , the subgraph induced by $V (G) \ W$ is Hamilton…

A solution to a conjecture on the signless Laplacian spectral radius for t-color-critical graphs

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

The spectral radius of minor free graphs

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

The signless Laplacian spectral radius of graphs without trees

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

The bipartite Turan number and spectral extremum for linear forests

The signless Laplacian spectral radius of graphs without intersecting odd cycles

On the spectral radius of graphs without a star forest

The signless Laplacian spectral radius of graphs with forbidding linear forests

On the signless Laplacian spectral radius of Ks,t​-minor free graphs

Erdos-Gallai Stability Theorem for Linear Forests

Spectral extremal results with forbidding linear forests

Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs

A solution to a conjecture on the signless Laplacian spectral radius for $t$ -color-critical graphs

On the $A_{α}$ -spectral radius of graphs without linear forests

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

On the signless Laplacian spectral radius of $K_{s, t}$ -minor free graphs

Some new sufficient conditions for $2 p$ -Hamilton-biconnectedness of graphs