activity
20122026
most citedColoring the normalized Laplacian for oriented hypergraphs

12 citations · 40 across the 78 of their papers we have counts for

collaborators
Showing 2022Show all

7 papers · 1 filter

math.CO2022

Constructing cospectral hypergraphs

Aida Abiad, Antonina P. Khramova

Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important s…

cs.LO2022

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…

math.CO2022

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.

math.CO2022

Extending a conjecture of Graham and Lovász on the distance characteristic polynomial

Aida Abiad, Boris Brimkov, Sakander Hayat +2

Graham and Lovász conjectured in 1978 that the sequence of normalized coefficients of the distance characteristic polynomial of a tree of order is unimodal with the maximum val…

math.CO2022★ 3 cited

On the -independence number of graph products

Aida Abiad, Hidde Koerts

The -independence number of a graph, , is the maximum size of a set of vertices at pairwise distance greater than , or alternatively, the independence number of the $…

math.CO2022

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…

math.CO2022★ 1 cited

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…