arXiv Analytics

Sign in

arXiv:1911.01113 [math.CO]AbstractReferencesReviewsResources

On eigenvalue multiplicity in signed graphs

Farzaneh Ramezani, Peter Rowlinson, Zoran Stanic

Published 2019-11-04Version 1

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.

Comments: 13 pages
Categories: math.CO
Subjects: 05C22, 05C50
Related articles: Most relevant | Search more
arXiv:2009.12680 [math.CO] (Published 2020-09-26)
Generalizing Kirchhoff laws for Signed Graphs
arXiv:1610.04690 [math.CO] (Published 2016-10-15)
Negative Circles in Signed Graphs: A Problem Collection
arXiv:1809.08594 [math.CO] (Published 2018-09-23)
A counterexample to a conjecture of Wang and Hou on signed graphs

Links

Toolbox