On the signed graphs with two distinct eigenvalues
classification
🧮 math.CO
math.SP
keywords
graphssignedbipartitedistincteigenvaluesfamiliesconsiderconstruct
read the original abstract
We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We construct some families of bipartite signed graphs with only two distinct eigenvalues. This leads to constructing infinite families of regular bipartite Ramanujan graphs.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Open problems in the spectral theory of signed graphs
Survey of adjacency spectra results for signed graphs and open problems that generalize those studied for unsigned graphs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.