1 citations · 1 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
An infinite class of Neumaier graphs and non-existence results
Aida Abiad, Wouter Castryck, Maarten De Boeck +2
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work w…
math.CO2021
Characterizing and computing weight-equitable partitions of graphs
Aida Abiad, Christopher Hojny, Sjanne Zeijlemaker
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 assumpti…