Aida Abiad

According to our database, Aida Abiad authored at least 25 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A switching method for constructing cospectral gain graphs.

Aida Abiad, Francesco Belardo, Antonina P. Khramova

Discret. Math., April, 2024

2023

Bounding the sum of the largest signless Laplacian eigenvalues of a graph.

Aida Abiad, Leonardo Silva de Lima, Sina Kalantarzadeh, Mona Mohammadi, Carla Silva Oliveira

Discret. Appl. Math., December, 2023

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

Aida Abiad, Cristina Dalfó, Miguel Angel Fiol, Sjanne Zeijlemaker

Discret. Appl. Math., July, 2023

The M-matrix group inverse problem for distance-biregular graphs.

Aida Abiad, Ángeles Carmona, Andrés M. Encinas, María José Jiménez

Comput. Appl. Math., June, 2023

An infinite class of Neumaier graphs and non-existence results.

Aida Abiad, Wouter Castryck, Maarten De Boeck, Jack H. Koolen, Sjanne Zeijlemaker

J. Comb. Theory, Ser. A, 2023

Eigenvalue Bounds for Sum-Rank-Metric Codes.

Aida Abiad, Antonina P. Kharmova, Alberto Ravagnani

CoRR, 2023

Descriptive complexity of controllable graphs.

Aida Abiad, Anuj Dawar, Octavio Zapata

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Optimization of eigenvalue bounds for the independence and chromatic number of graph powers.

Aida Abiad, Gabriel Coutinho, Miguel Angel Fiol, Bruno Demattos Nogueira, Sjanne Zeijlemaker

Discret. Math., 2022

Neumaier graphs with few eigenvalues.

Aida Abiad, Bart De Bruyn, Jozefien D'haeseleer, Jack H. Koolen

Des. Codes Cryptogr., 2022

Descriptive complexity of the generalized spectra of graphs.

Aida Abiad, Anuj Dawar, Octavio Zapata

CoRR, 2022

The Kaleidoscopic Game of Life.

Aida Abiad, Merit Geldmacher, Alexander Grigoriev

Complex Syst., 2022

2021

On the status sequences of trees.

Aida Abiad, Boris Brimkov, Alexander Grigoriev

Theor. Comput. Sci., 2021

Enumeration of cospectral and coinvariant graphs.

Aida Abiad, Carlos A. Alfaro

Appl. Math. Comput., 2021

2020

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes.

Aida Abiad, Sander Gribling, Domenico Lahaye, Matthias Mnich, Guus Regts, Lluís Vena, Gerard Verweij, Peter J. Zwaneveld

Discret. Optim., 2020

Printed circuit boards isomorphism: An experimental study.

Aida Abiad, Alexander Grigoriev, Stefanie Niemzok

Comput. Ind. Eng., 2020

2019

On the k-independence number of graphs.

Aida Abiad, Gabriel Coutinho, Miquel A. Fiol

Discret. Math., 2019

Graph switching, 2-ranks, and graphical Hadamard matrices.

Aida Abiad, Steve Butler, Willem H. Haemers

Discret. Math., 2019

2018

A characterization of weight-regular partitions of graphs.

Aida Abiad

Electron. Notes Discret. Math., 2018

2017

On the Wiener index, distance cospectrality and transmission-regular graphs.

Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song, Jason Williford

Discret. Appl. Math., 2017

An Application of Hoffman Graphs for Spectral Characterizations of Graphs.

Qianqian Yang, Aida Abiad, Jack H. Koolen

Electron. J. Comb., 2017

2016

Some spectral and quasi-spectral characterizations of distance-regular graphs.

Aida Abiad, Edwin R. van Dam, Miguel Angel Fiol

J. Comb. Theory, Ser. A, 2016

Switched symplectic graphs and their 2-ranks.

Aida Abiad, Willem H. Haemers

Des. Codes Cryptogr., 2016

2014

Corrigendum to "Algebraic characterizations of regularity properties in bipartite graphs" [European J. Combin. 34 (2013) 1223-1231].

Aida Abiad, Cristina Dalfó, Miguel Angel Fiol

Eur. J. Comb., 2014

2013

Algebraic characterizations of regularity properties in bipartite graphs.

Aida Abiad, Cristina Dalfó, Miguel Angel Fiol

Eur. J. Comb., 2013

2012

Cospectral Graphs and Regular Orthogonal Matrices of Level 2.

Aida Abiad, Willem H. Haemers

Electron. J. Comb., 2012