Showing 2026Show all
3 papers · 1 filter
math.CO2026
The signless Laplacian spectral Turán problems for disjoint triangles
Ming-Zhu Chen, Ya-Lei Jin, Peng-Li Zhang
The classical Turán-type problem for graphs forbidding disjoint triangles has been resolved firstly by Erdős [Arch. Math. 13 (1962) 222-227] for graphs of sufficiently large or…
math.CO2026
A solution to a conjecture on the signless Laplacian spectral radius for -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 -color-critical if removing some induced matching of size 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 be a graph with chromatic number . Denote by and the Turán number and the set of all extremal graphs for , respectively. In addition, $…