Photo by siora18 from unsplash
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… Click to show full 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 weightequitable partitions.
Keywords:
computing weight;
partitions graphs;
weight equitable;
equitable partitions;
characterizing computing
Journal Title: Linear Algebra and its Applications
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Linear Algebra and its Applications
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!