paper

Spectral Turán problem for -free signed graphs

arXiv:2508.05500

Abstract

The classical spectral Turán problem is to determine the maximum spectral radius of an -free graph of order . Zhai and Wang [Linear Algebra Appl, 437 (2012) 1641-1647] determined the maximum spectral radius of -free graphs of given order. Additionally, Nikiforov obtained spectral strengthenings of the Kővari-Sós-Turán theorem [Linear Algebra Appl, 432 (2010) 1405-1411] when the forbidden graphs are complete bipartite. The spectral Turán problem concerning forbidden complete bipartite graphs in signed graphs has also attracted considerable attention. Let be the set of all unbalanced signed graphs with underlying graphs . Since the cases where or do not conform to the definition of , it follows that . Wang and Lin [Discrete Appl. Math, 372 (2025) 164-172] have solved the case of since is in this situation. This paper gives an answer for and completely characterizes the corresponding extremal signed graphs.

Spectral Turán problem for $\mathcal{K}_{3,3}^{-}$-free signed graphs · wovepaper