Paper
The spectral radius of $1$-planar graphs without complete subgraphs
Authors
Weilun Xu, An Chang
Abstract
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 -planar graphs, we determine completely the unique spectral extremal graph among all -free or -free -planar graphs, and provide a characterization of the spectral extremal graphs for -free -planar graphs, confining the candidates to a specific, small family.