Papers

Topics

Authors

Recent

View all

AI Research Assistant

Well-researched responses based on relevant abstracts and paper content.

Custom Instructions Pro

Preferences or requirements that you'd like Emergent Mind to consider when generating responses.

Gemini 2.5 Flash

Gemini 2.5 Flash 78 tok/s

Gemini 2.5 Pro 46 tok/s Pro

GPT-5 Medium 12 tok/s Pro

GPT-5 High 14 tok/s Pro

GPT-4o 89 tok/s Pro

Kimi K2 212 tok/s Pro

GPT OSS 120B 472 tok/s Pro

Claude Sonnet 4 39 tok/s Pro

2000 character limit reached

On the signed graphs with two distinct eigenvalues (1511.03511v5)

Published 10 Nov 2015 in math.CO and math.SP

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.