1 citations · 1 across the 7 of their papers we have counts for
8 papers
The Zero Forcing Number of Graph Powers
Aida Abiad, Mary Flagg, Sina Ghasemi Nezhad +1
The -th power of a simple graph , denoted , is the graph with vertex set where two vertices are adjacent if they are within distance in . We investigate th…
Computing fixed point free automorphisms of graphs
Aida Abiad, Gabriel Coutinho, Emanuel Juliano +2
In 1981, Lubiw proved that the fixed point free automorphism problem (FPFAut) is NP-complete: given a graph G, determine whether there exists an automorphism that maps no vertex of…
A unified framework for the Expander Mixing Lemma for irregular graphs and its applications
Aida Abiad, Sjanne Zeijlemaker
A unified framework for the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues is presented, as well as two new versions of it. While the existing Expander Mixi…
On the existence of small strictly Neumaier graphs
Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In par…
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
Aida Abiad, Robin Simoens, Sjanne Zeijlemaker
We determine the diameter of generalized Grassmann graphs and the zero forcing number of some generalized Johnson graphs, generalized Grassmann graphs and the Hamming graphs. Our w…
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…
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…
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…