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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2117218 (Why is no real title available?)
- A decomposition of signed graphs with two eigenvalues
- An introduction to the theory of graph spectra
- Matrices in the theory of signed simple graphs
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- On a class of strongly regular signed graphs
- On strongly regular signed graphs
- On the KNS conjecture in type \(E\)
- Signed line graphs with least eigenvalue -2: the star complement technique
Cited in
(13)- Eigenvalue multiplicity in cubic signed graphs
- Signed graphs whose spectrum is bounded by \(- 2\)
- Signed graphs with at most three eigenvalues
- A remark on eigen values of signed graph
- A note on eigenvalues of signed graphs
- On the multiplicity of \(\alpha\) as an \(A_\alpha(\varGamma)\)-eigenvalue of signed graphs with pendant vertices
- More on signed graphs with at most three eigenvalues
- Maximal signed graphs with odd signed cycles as star complements
- Signed graphs with three eigenvalues: biregularity and beyond
- On the eigenvalues of complete bipartite signed graphs
- On the multiplicity of positive eigenvalues of a graph
- A decomposition of signed graphs with two eigenvalues
- On the multiplicities of digraph eigenvalues
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)