  For signed graphs we provide a cubic polynomial upper bound on the
multiplicity of its eigenvalues. We show that this bound is sharp by providing
examples of signed graphs in which it is attained. We also discuss particular
cases in which the bound can be decreased.
