加载中…
Let be the set of all balanced signed graphs with underlying graphs . A signed graph is called -free if it contains no subgraph isomorphic to any member of . In this paper, we characterize the extremal graphs that achieve the maximum index among all -free unbalanced signed graphs of order when and .

生成讲解博客的中文版本

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