Lethbridge Number Theory and Combinatorics Seminar: Joy Morris

Determining the full automorphism group of a graph is a hard problem with a long history. I will discuss some of the major results that involve finding graphs with a given automorphism group. I will then focus on circulant graphs, and describe some structural results and algorithms that help us determine the full automorphism group of the graph. I will also give some asymptotic results about how many circulant graphs fall into different categories.