


























In this paper, we focus on the index ( largest eigenvalue) of the adjacency matrix of connected signed graphs. We give some general results on the index when the corresponding signed graph is perturbed. As applications, we determine the first five largest index among all unbalanced bicyclic graphs on n >= 36 vertices together with the corresponding extremal signed graphs whose index attain these values.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。