4 citations · 15 across the 62 of their papers we have counts for
5 papers · 1 filter
On the status sequences of trees
Aida Abiad, Boris Brimkov, Alexander Grigoriev
The status of a vertex in a connected graph is the sum of the distances from to all other vertices. The status sequence of a connected graph is the list of the statuses of…
A characterization and an application of weight-regular partitions of graphs
Aida Abiad
A natural generalization of a regular (or equitable) partition of a graph, which makes sense also for non-regular graphs, is the so-called weight-regular partition, which gives to…
On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes
Aida Abiad, Sander Gribling, Domenico Lahaye +5
We consider a fundamental integer programming (IP) model for cost-benefit analysis flood protection through dike building in the Netherlands, due to Verweij and Zwaneveld. Experime…
On the -independence number of graphs
A. Abiad, G. Coutinho, M. A. Fiol
This paper generalizes and unifies the existing spectral bounds on the -independence number of a graph, which is the maximum size of a set of vertices at pairwise distance great…
Graph switching, 2-ranks, and graphical Hadamard matrices
Aida Abiad, Steve Butler, Willem H. Haemers
We study the behaviour of the 2-rank of the adjacency matrix of a graph under Seidel and Godsil-McKay switching, and apply the result to graphs coming from graphical Hadamard matri…