  We construct infinitely many signed graphs having symmetric spectrum, by
using the NEPS and rooted product of signed graphs. We also present a method
for constructing large cospectral signed graphs. Although the obtained family
contains only a minority of signed graphs, it strengthen the belief that the
signed graphs with symmetric spectrum are deeper than bipartite graphs, i.e the
unsigned graphs with symmetric spectrum.
