加载中…
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.

生成讲解博客的中文版本

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