4 citations · 6 across the 11 of their papers we have counts for
15 papers
Descriptive complexity of the generalized spectra of graphs
Aida Abiad, Anuj Dawar, Octavio Zapata
Two graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues, and generalized cospectral if they are cospectral and so are their complemen…
Bounding the sum of the largest signless Laplacian eigenvalues of a graph
Aida Abiad, Leonardo de Lima, Sina Kalantarzadeh +2
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.
The -matrix group inverse problem for distance-biregular graphs
Aida Abiad, Ángeles Carmona, Andrés M. Encinas +1
In this paper we provide the group inverse of the combinatorial Laplacian matrix of distance-biregular graphs using the so-called equilibrium measures for sets obtained by deleting…
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…
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…