Characterizing and computing weight-equitable partitions of graphs
- Author
- Aida Abiad (UGent) , Christopher Hojny and Sjanne Zeijlemaker
- Organization
- Project
- 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.
- Keywords
- Discrete Mathematics and Combinatorics, Geometry and Topology, Numerical Analysis, Algebra and Number Theory, Weight-equitable partition, Cograph, Eigenvalue, SPECTRAL PROPERTIES, EIGENVALUES, COGRAPHS
Downloads
-
1-s2.0-S0024379522000982-main.pdf
- full text (Published version)
- |
- open access
- |
- |
- 493.77 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8746898
- MLA
- Abiad, Aida, et al. “Characterizing and Computing Weight-Equitable Partitions of Graphs.” LINEAR ALGEBRA AND ITS APPLICATIONS, vol. 645, 2022, pp. 30–51, doi:10.1016/j.laa.2022.03.003.
- APA
- Abiad, A., Hojny, C., & Zeijlemaker, S. (2022). Characterizing and computing weight-equitable partitions of graphs. LINEAR ALGEBRA AND ITS APPLICATIONS, 645, 30–51. https://doi.org/10.1016/j.laa.2022.03.003
- Chicago author-date
- Abiad, Aida, Christopher Hojny, and Sjanne Zeijlemaker. 2022. “Characterizing and Computing Weight-Equitable Partitions of Graphs.” LINEAR ALGEBRA AND ITS APPLICATIONS 645: 30–51. https://doi.org/10.1016/j.laa.2022.03.003.
- Chicago author-date (all authors)
- Abiad, Aida, Christopher Hojny, and Sjanne Zeijlemaker. 2022. “Characterizing and Computing Weight-Equitable Partitions of Graphs.” LINEAR ALGEBRA AND ITS APPLICATIONS 645: 30–51. doi:10.1016/j.laa.2022.03.003.
- Vancouver
- 1.Abiad A, Hojny C, Zeijlemaker S. Characterizing and computing weight-equitable partitions of graphs. LINEAR ALGEBRA AND ITS APPLICATIONS. 2022;645:30–51.
- IEEE
- [1]A. Abiad, C. Hojny, and S. Zeijlemaker, “Characterizing and computing weight-equitable partitions of graphs,” LINEAR ALGEBRA AND ITS APPLICATIONS, vol. 645, pp. 30–51, 2022.
@article{8746898, 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.}}, author = {{Abiad, Aida and Hojny, Christopher and Zeijlemaker, Sjanne}}, issn = {{0024-3795}}, journal = {{LINEAR ALGEBRA AND ITS APPLICATIONS}}, keywords = {{Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory,Weight-equitable partition,Cograph,Eigenvalue,SPECTRAL PROPERTIES,EIGENVALUES,COGRAPHS}}, language = {{eng}}, pages = {{30--51}}, title = {{Characterizing and computing weight-equitable partitions of graphs}}, url = {{http://doi.org/10.1016/j.laa.2022.03.003}}, volume = {{645}}, year = {{2022}}, }
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: