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\le n^2\mathrm{/}4$, we determine the maximal index of complete signed graphs with $n$ vertices and $m$ negative edges. This settles (the corrected version of) a conjecture by Koledin and Stani'c (2017).