Spectral Tur\'an problem for K5--free signed graphs
Abstract
The classical spectral Tur\'an problem is to determine the maximum spectral radius of an F-free graph of order n. Let Kk- be the set of all unbalanced Kk. In this paper, we focus on the spectral Tur\'an problem of Kk--free unbalanced signed graph for k≥5. Moreover, we give an answer for k=5 and completely characterize the corresponding extremal signed graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.