2000 character limit reached
On the signed graphs with two distinct eigenvalues
Published 10 Nov 2015 in math.CO and math.SP | (1511.03511v5)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.