< Terug naar vorige pagina


Characterizing and computing weight-equitable partitions of graphs

Tijdschriftbijdrage - Tijdschriftartikel

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.

Tijdschrift: Linear Algebra & its Applications
ISSN: 0024-3795
Volume: 645
Pagina's: 30-51
Jaar van publicatie:2022