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