Spectral Tur\'{a}n problem for $\mathcal{{K}}_{3,3}^{-}$-free signed graphs
Mingsong Qin, Dan Li

TL;DR
This paper investigates the maximum spectral radius of $ ext{K}_{3,3}^{-}$-free signed graphs, extending spectral Turán problems to unbalanced signed graphs and providing a complete characterization of extremal cases.
Contribution
It solves the spectral Turán problem for $ ext{K}_{3,3}^{-}$-free signed graphs, a case not previously addressed, and characterizes the extremal graphs in this setting.
Findings
Determined the maximum spectral radius for $ ext{K}_{3,3}^{-}$-free signed graphs.
Provided a complete characterization of extremal signed graphs for the $ ext{K}_{3,3}^{-}$-free case.
Extended spectral Turán problem results to unbalanced signed graphs with specific forbidden subgraphs.
Abstract
The classical spectral Tur\'{a}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\H{o}vari-S\'{o}s-Tur\'{a}n theorem [Linear Algebra Appl, 432 (2010) 1405-1411] when the forbidden graphs are complete bipartite. The spectral Tur\'{a}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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
