paper

Spectral Turán problem for -free unbalanced signed graphs

arXiv:2604.11428

Abstract

Let denote the family of all graphs consisting of copies of that are allowed to share vertices and be the set of all unbalanced signed graphs whose underlying graphs are elements of . In this paper, we characterize the extremal graphs that achieve the maximum index and spectral radius among all -free unbalanced signed graphs with given order.

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