Characterizing and computing weight-equitable partitions of graphs

Aida Abiad Monge, Christopher Hojny, Sjanne Zeijlemaker (Corresponding author)

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

134 Downloads (Pure)

Samenvatting

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-2Engels
Pagina's (van-tot)30-51
Aantal pagina's22
TijdschriftLinear Algebra and Its Applications
Volume645
DOI's
StatusGepubliceerd - 15 jul. 2022

Financiering

The research of the first author is partially supported by the FWO grant 1285921N . The authors are very grateful to an anonymous referee for pointing out the characterization and implications of cographs by twins from Lemma 23 and Theorem 24 , which simplified the previous proofs in Section 5.2 . We also thank Frits Spieksma for carefully reading the article.

FinanciersFinanciernummer
Fonds Wetenschappelijk Onderzoek1285921N

    Vingerafdruk

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

    Citeer dit