Ya-Lei Jin

collaborators

2 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, $…

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

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