Which graphs are determined by their spectrum?

2003/05/27 by Edwin R. van Dam, Edwin van Dam, Willem H. Haemers · 5 citations
Computer Science · Mathematics · #Adjacency matrix #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph theory and applications #Laplacian matrix #Mathematics #Matrix (chemical analysis) #Matrix Theory and Algorithms #Physics #Spectrum (functional analysis)

paper · pdf · doi:10.1016/s0024-3795(03)00483-x

openalex publication_date 2003/05/27 · crossref created 2003/05/27 · crossref issued 2003/11/01 · crossref published 2003/11/01 · crossref published-print 2003/11/01 · crossref deposited 2019/03/20 · openalex created_date 2025/10/10 · crossref indexed 2026/07/29 · openalex updated_date 2026/08/01

Citations

• Spectral graph theory [CBMS Conference on Recent Advances in Spectral Graph Theory held at California State University at Fresno, June 6 - 10. 1994]
• Strongly regular graphs with (—1,1,0) adjacency matrix having eigenvalue 3
• Can One Hear the Shape of a Drum?
• Congruent Graphs and the Connectivity of Graphs

Cited by

• Hearing shapes of drums: Mathematical and physical aspects of isospectrality
• An Upper Bound on Generalized Cospectral Mates of Oriented Graphs Using Skew-Walk Matrices
• Enumeration of cubic Cayley graphs on dihedral groups
• Distance-regular Cayley graphs with least eigenvalue -2 - 2
• Line graph [wikipedia]