  We present the first steps towards the determination of the signed graphs for
which the adjacency matrix has all but at most two eigenvalues equal to 1 or
-1. Here we deal with the disconnected, the bipartite and the complete signed
graphs. In addition, we present many examples which cannot be obtained from an
unsigned graph or its negative by switching.
