On the signed graphs with two distinct eigenvalues

2015/11/10 by Farzaneh Ramezani, Ramezani, F. · 1 citation
Mathematics · #Graph theory and applications #Finite Group Theory Research #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1511.03511

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.

Cited by

• Open problems in the spectral theory of signed graphs

Related

• Some regular signed graphs with only two distinct eigenvalues
• The signed graphs with two eigenvalues unequal to ± 1
• On signed graphs with at most two eigenvalues unequal to ± 1
• Signed (0,2)-graphs with few eigenvalues and a symmetric spectrum
• Equitable partitions for Ramanajun graphs