Signed graphs with maximal index

The index of a signed graph is the largest eigenvalue of its adjacency matrix. For positive integers n and m ≤ n 2 / 4 , we determine the maximum index of complete signed graphs with n vertices and m negative edges and characterize the signed graphs achieving this maximum. This settles (the corrected version of) a conjecture by Koledin and Stanic (2017).