(Spectral; Fall 23) 07 - Distinct eigenvalues and diameter; distinct eigenvalues and automorphisms

In this video we work through finding a bound on the diameter of a graph in relationship to the number of distinct eigenvalues; we then look at what happens for automorphisms when the eigenvalues of the adjacency matrix are all distinct.

0:00 Diameter bound by number of distinct evalues
23:14 Automorphisms of graphs with distinct evalues