Characterizing and computing weight-equitable partitions of graphs
Combinatorics
2021-09-08 v1
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 well-known 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.
Keywords
Cite
@article{arxiv.2109.03005,
title = {Characterizing and computing weight-equitable partitions of graphs},
author = {Aida Abiad and Christopher Hojny and Sjanne Zeijlemaker},
journal= {arXiv preprint arXiv:2109.03005},
year = {2021}
}