Characterizing and computing weight-equitable partitions of graphs

Onderzoeksoutput: Articlepeer review

30 Downloads (Pure)


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 work we aim to further our algebraic and computational understanding of weight-equitable partitions. We do so by showing several spectral properties and algebraic characterizations, and by providing a method to find coarse weight-equitable partitions.

Originele taal-2English
Pagina's (van-tot)30-51
Aantal pagina's22
TijdschriftLinear Algebra and its Applications
StatusPublished - 15 jul 2022


Duik in de onderzoeksthema's van 'Characterizing and computing weight-equitable partitions of graphs'. Samen vormen ze een unieke vingerafdruk.

Citeer dit