School of Mathematical Sciences

Graph Spectra menu

Graph Spectra

Adam Bohn
Wed, 01/12/2010 - 13:00

Any undirected graph can be viewed as an adjacency matrix, and the eigenvalues of such a matrix is known as the graph's spectrum.  I will talk about various aspects of a graph's structure which are encoded by its spectrum, and present two proofs of the well-known theorem which says that if all a graph's eigenvalues are simple, then its automorphism group is an abelian 2-group.