most citedOn inertia and ratio type bounds for the -independence number of a graph and their relationship

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2022★ 1 cited

On inertia and ratio type bounds for the -independence number of a graph and their relationship

Aida Abiad, Cristina Dalfó, Miquel Àngel Fiol +1

For , the -independence number of a graph is the maximum number of vertices that are mutually at distance greater than . The well-known inertia and ratio bounds…

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…