Maximizing the largest eigenvalues of signed unicyclic graphs

摘要

Let U be the set of all unbalanced unicyclic graphs of order n and girth at least g. In this paper, we determine the signed graph whose largest eigenvalue is maximal among all graphs in U