Speaker
Aida Abiad
(Eindhoven University of Techonolgy)
Description
A unified framework of the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues will be presented, as well as several new versions of it. We will also show some of its applications in graph theory, which include spectral bounds on the zero forcing number of a graph. To derive our results we use a new application of weight partitions of graphs, where the Perron eigenvector entries are used as vertex weights as a way to regularise the graph.
Authors
Aida Abiad
(Eindhoven University of Techonolgy)
Sjanne Zeijlemaker
(Eindhoven University of Techonolgy)