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 language | English |
|---|---|
| Pages (from-to) | 30-51 |
| Number of pages | 22 |
| Journal | Linear Algebra and Its Applications |
| Volume | 645 |
| DOIs | |
| Publication status | Published - 15 Jul 2022 |
Funding
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.
| Funders | Funder number |
|---|---|
| Fonds Wetenschappelijk Onderzoek | 1285921N |
Keywords
- Cograph
- Eigenvalue
- Weight-equitable partition
Fingerprint
Dive into the research topics of 'Characterizing and computing weight-equitable partitions of graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver