2 papers
math.CO2025
The spectral radius of -planar graphs without complete subgraphs
Weilun Xu, An Chang
A 1-planar graph refers to a graph that can be drawn on the plane such that each edge has at most one crossing. In this paper, focusing on the spectral Turán-type problems of -…
math.CO2024
Almost regular subgraphs under spectral radius constrains
Weilun Xu, Guorong Gao, An Chang
A graph is called -almost regular if its maximum degree is at most times the minimum degree. ErdÅs and Simonovits showed that for a constant and a suffi…