12 citations · 40 across the 78 of their papers we have counts for
10 papers · 1 filter
Unified bounds for the independence number of graph powers
Aida Abiad, Jiang Zhou
For a graph , its -th power is constructed by placing an edge between two vertices if they are within distance of each other. The -independence number i…
Switching graphs and Hadamard matrices
Aida Abiad, Louka Peters
Local operations of combinatorial structures (graphs, Hadamard matrices, codes, designs) that maintain the basic parameters unaltered, have been widely used in the literature under…
Switching methods of level 2 for the construction of cospectral graphs
Aida Abiad, Nils van de Berg, Robin Simoens
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospec…
Hoffman colorings of graphs
Aida Abiad, Wieb Bosma, Thijs van Veluw
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining…
A linear programming bound for sum-rank metric codes
Aida Abiad, Alexander L. Gavrilyuk, Antonina P. Khramova +1
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances,…
Eigenvalue bounds and alternating rank-metric codes
Aida Abiad, Gianira N. Alfarano, Alberto Ravagnani
In this note we apply a spectral method to the graph of alternating bilinear forms. In this way, we obtain upper bounds on the size of an alternating rank-metric code for given val…
Eigenvalue bounds for the distance- chromatic number of a graph and their application to Lee codes
Aida Abiad, Alessandro Neri, Luuk Reijnders
We derive eigenvalue bounds for the -distance chromatic number of a graph, which is a generalization of the classical chromatic number. We apply such bounds to hypercube graphs,…
Note on the product of the largest and the smallest eigenvalue of a graph
Aida Abiad, Cristina Dalfó, Miquel Àngel Fiol
In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is…
The clique number of the exact distance -power graph: complexity and eigenvalue bounds
Aida Abiad, Afrouz Jabal Ameli, Luuk Reijnders
The exact distance -power of a graph , , is a graph which has the same vertex set as , with two vertices adjacent in if and only if they a…
A unified framework for the Expander Mixing Lemma for irregular graphs and its applications
Aida Abiad, Sjanne Zeijlemaker
A unified framework for the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues is presented, as well as two new versions of it. While the existing Expander Mixi…