works on
clique spectral radius 1color-critical graphs 1extremal graph theory 1forbidden subgraphs 1spectral graph theory 1

From the 1 of 1 linked paper with an AI index.

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2026

Clique spectral extremal problem on disjoint color-critical graphs

Changjiang Bu, Peiyan Wei, Haotian Zeng

The paper determines, for sufficiently large n, the unique n‑vertex graph that maximizes the s‑clique spectral radius among all graphs that avoid a disjoint union of color‑critical…