Combinatorics-Spectral characterization of graphs

Speaker: Sebastian Cioaba, University of Delaware
Date and time: Tuesday, April 3, 1-2pm
Place: Rome 771
Title: Spectral characterization of graphs

Abstract:The spectrum of a graph is the multiset of the eigenvalues of its adjacency matrix.  A graph G is determined by its spectrum (DS) if any graph that has the same spectrum as G must be isomorphic to G.  In general, it is a non-trivial problem to determine whether a given graph is DS.  In this talk, I will explain the basic results related to spectral characterization of graphs and describe some of our recent results related to spectral characterization of friendship graphs and graphs in the Johnson association scheme.