On eigenvalue multiplicity in signed graphs

From MaRDI portal




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.









This page was built for publication: On eigenvalue multiplicity in signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q785783)