2000 character limit reached
Spectral Turán problem for $\mathcal{K}_5^{-}$-free signed graphs
Published 27 Sep 2023 in math.CO | (2309.15434v1)
Abstract: The classical spectral Tur\'{a}n problem is to determine the maximum spectral radius of an $\mathcal{F}$-free graph of order $n.$ Let $\mathcal{K}{k}{-}$ be the set of all unbalanced $K_k.$ In this paper, we focus on the spectral Tur\'{a}n problem of $\mathcal{K}{k}{-}$-free unbalanced signed graph for $k\geq5$. Moreover, we give an answer for $k=5$ and completely characterize the corresponding extremal signed graph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.