most citedSome Turán-type results for the signless Laplacian spectral radius

2 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

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.CO2025

Spectral extremal problems for the -spectral radius of hypergraphs

Jian Zheng, Honghai Li, Li Su

Let be an -vertex -uniform hypergraph, and let be an -vertex -uniform hypergraph. Denote by the number of isomorphic copies of in . Fo…

math.CO2025

Spectral Turán-type problems for the -spectral radius of hypergraphs with degree stability

Jian Zheng, Honghai Li, Li Su

An -pattern is an ordered pair , where is a positive integer and is a set of -multisets with elements from . An -graph is said to be -co…

math.CO2025★ 2 cited

Some Turán-type results for the signless Laplacian spectral radius

Jian Zheng, Yongtao Li, Yi-Zheng Fan

Half a century ago, Bollobás and Erdős [Bull. London Math. Soc. 5 (1973)] proved that every -vertex graph with edges c…

math.CO2025

The signless Laplacian spectral Turán problems for color-critical graphs

Jian Zheng, Yongtao Li, Honghai Li

The well-known Turán theorem states that if is an -vertex -free graph, then , with equality if and only if is the -partite Turán graph $T…

math.CO2025

A signless Laplacian spectral Erdös-Stone-Simonovits theorem

Jian Zheng, Honghai Li, Li Su

The celebrated Erdős--Stone--Simonovits theorem states that , where is the chromatic number of . In 2…