Strongly regular graphs with (—1,1,0) adjacency matrix having eigenvalue 3

1968/04/01 by J.J. Seidel · 9 citations
Engineering · Mathematics · #Adjacency matrix #Bipartite graph #Chordal graph #Combinatorics #Discrete mathematics #Eigenvalues and eigenvectors #Finite Group Theory Research #Graph #Graph power #Graph theory and applications #Indifference graph #Integer matrix #Line graph #Mathematics #Nonnegative matrix #Pathwidth #Strongly regular graph #Symmetric matrix #Two-graph #graph theory and CDMA systems

paper · pdf · doi:10.1016/0024-3795(68)90008-6

crossref issued 1968/04/01 · crossref published 1968/04/01 · crossref published-print 1968/04/01 · openalex publication_date 1968/04/01 · crossref created 2002/07/26 · crossref deposited 2019/04/12 · openalex created_date 2025/10/10 · crossref indexed 2026/03/16 · openalex updated_date 2026/07/31

Citations

• Self-dual configurations and regular graphs

Cited by

• Graphs with least eigenvalue −2; a historical survey and recent developments in maximal exceptional graphs
• Which graphs are determined by their spectrum?
• Equiangular lines
• On characterizing certain graphs with four eigenvalues by their spectra
• 5-chromatic strongly regular graphs
• Strongly Regular Graphs Derived from Combinatorial Designs
• Equiangular lines, Incoherent sets and Quasi-symmetric designs
• Distance-regular Cayley graphs with least eigenvalue -2 - 2
• Adjacency matrix [wikipedia]