1 paper
Farzaneh Ramezani, Peter Rowlinson, Zoran Stanic
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…