12 citations · 40 across the 78 of their papers we have counts for
4 papers · 1 filter
Constructions of cospectral graphs with different zero forcing numbers
Aida Abiad, Boris Brimkov, Jane Breen +3
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show t…
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…
A bound for the -domination number of a graph in terms of its eigenvalue multiplicities
A. Abiad, S. Akbari, M. H. Fakharan +1
Let be a connected graph of order with domination number . Wang, Yan, Fang, Geng and Tian [Linear Algebra Appl. 607 (2020), 307-318] showed that for any Laplacian eig…
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…