On eigenvalue multiplicity in signed graphs
Combinatorics
2019-11-05 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1911.01113,
title = {On eigenvalue multiplicity in signed graphs},
author = {Farzaneh Ramezani and Peter Rowlinson and Zoran Stanic},
journal= {arXiv preprint arXiv:1911.01113},
year = {2019}
}
Comments
13 pages