Sjanne Zeijlemaker (Eindhoven University of Technology) - Characterizing and computing weight-equitable partitions of graphs
Supervisor: Aida Abiad
Recorded full presentation
Abstract
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several classic eigenvalue bounds. In this talk, we discuss several algebraic and computational properties of weight-equitable partitions. In particular, we present an algorithm to compute (weight-)equitable partitions such that each cell has size two and provide a method to generate coarse (weight-)equitable partitions using the join operator.
Supervisor: Aida Abiad
Recorded full presentation
Abstract
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumption in several classic eigenvalue bounds. In this talk, we discuss several algebraic and computational properties of weight-equitable partitions. In particular, we present an algorithm to compute (weight-)equitable partitions such that each cell has size two and provide a method to generate coarse (weight-)equitable partitions using the join operator.