Characterizing and computing weight-equitable partitions of graphs

Research output: Contribution to journalArticlepeer-review

8 Downloads (Pure)

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 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.

Original languageEnglish
Pages (from-to)30-51
Number of pages22
JournalLinear Algebra and its Applications
Volume645
DOIs
Publication statusPublished - 15 Jul 2022

Fingerprint

Dive into the research topics of 'Characterizing and computing weight-equitable partitions of graphs'. Together they form a unique fingerprint.

Cite this