Aida Abiad

activity

20142025

most citedA switching method for constructing cospectral gain graphs

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

On the sum of the largest and smallest eigenvalues of odd-cycle free graphs

Aida Abiad, Vladislav Taranchuk, Thijs van Veluw

Let $G$ be a graph with adjacency eigenvalues $λ_{1} \geq \dots \geq λ_{n}$ . Both $λ_{1} + λ_{n}$ and the odd girth of $G$ can be seen as measures of the bipartiteness of $G$ . Csikvári pr…

math.CO2016

An application of Hoffman graphs for spectral characterizations of graphs

Qianqian Yang, Aida Abiad, Jack H. Koolen

In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the $2$ -clique extension of the $(t+1)\times…

math.CO2014

Godsil-McKay switching and isomorphism

Aida Abiad, Andries E. Brouwer, Willem H. Haemers

Godsil-McKay switching is an operation on graphs that doesn't change the spectrum of the adjacency matrix. Usually (but not always) the obtained graph is non-isomorphic with the or…