Minicourse 1: A short course in spectral graph theory and distance-regular graphs
Lecturer: Sebastian Cioaba, University of Delaware, USA.
Abstract: In this short course, I will present the basics of spectral graph theory and distance-regular graphs. The presentation will be self-contained and after a short recap of linear algebra, we will describe the most common used matrices in spectral graph theory (adjacency matrix, Laplacian, signed adjacency matrix, normalized Laplacian, signless Laplacian), their eigenvalues and their basic properties. We will present some older and some recent applications of eigenvalues and spectral methods. For distance-regular graphs, we will describe the basic combinatorial and linear algebraic theory and some connections between distance-regular graphs and approximation algorithms in theoretical computer science and the problem of embedding graphs into Euclidean spaces with least distortion.
Minicourse 2: TBD
Lecturer: TBD
