Multiplicity Bounds for Arbitrary Eigenvalues of Connected Signed Graphs
Monther R. Alfuraidan, Suliman Khan

TL;DR
This paper establishes a sharp upper bound on the multiplicity of any eigenvalue in connected signed graphs, extending known nullity results to the entire spectrum and characterizing extremal cases.
Contribution
It introduces a universal bound for eigenvalue multiplicities in signed graphs based on girth, generalizing previous nullity-focused results to all eigenvalues.
Findings
Bound m(G_σ, λ) ≤ n - g(G_σ) + 2 for any eigenvalue λ
Characterization of extremal graphs achieving equality
Analysis of eigenvalues with multiplicity 1 and 2 in signed cycles
Abstract
The study of eigenvalue multiplicities plays a central role in the spectral theory of signed graphs, extending several classical results from the unsigned setting. While most existing work focuses on the nullity of a signed graph (the multiplicity of the eigenvalue ), much less is known for arbitrary eigenvalues. In this paper, we establish a sharp upper bound for the multiplicity of any real eigenvalue of a connected signed graph in terms of its girth. Our main result shows that \[ m(G_\sigma, \lambda) \le n - g(G_\sigma) + 2, \] where is the number of vertices and is the girth. We prove that equality holds if and only if is switching equivalent to one of the following extremal families: \begin{itemize} \item[(i)] a balanced complete graph with ; \item[(ii)] an antibalanced complete graph with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Tensor decomposition and applications · Spectral Theory in Mathematical Physics
