Algebraic Combinatorics Seminar - Olha Silina

Title: Abelian covering graphs and their properties

Abstract:

 A covering graph is a structure obtained from a graph by ‘replacing’ every vertex with a coclique of size $r$. The main focus of this talk is connections between (spectral) characteristic of a cover and properties such as being walk- or distance- regular.