加载中…
The classical spectral Turán problem is to determine the maximum spectral radius of an -free graph of order . This paper extends this framework to signed graphs. Let be the set of all unbalanced signed graphs with underlying graphs . Wang, Hou and Li [Linear Algebra Appl, 681 (2024) 47-65] previously determined the spectral Turán number of . In the present work, we characterize the extremal graphs that achieve the maximum index among all unbalanced signed graphs of order that are -free for . Furthermore, for , we identify the graphs with the second maximum index among all -free unbalanced signed graphs of fixed order .

生成讲解博客的中文版本

生成AI智能校验的中文版本