1 citations · 1 across the 8 of their papers we have counts for
8 papers
The inverse nullity pair problem and the strong nullity interlacing property
Aida Abiad, Bryan A. Curtis, Mary Flagg +3
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph . In…
Descriptive complexity of controllable graphs
Aida Abiad, Anuj Dawar, Octavio Zapata
Let be a graph on vertices with adjacency matrix , and let be the all-ones vector. We call controllable if the set of vectors $\mathbf{1}, A\mathbf{1},…
Cospectral mates for generalized Johnson and Grassmann graphs
Aida Abiad, Jozefien D'haeseleer, Willem H. Haemers +1
We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospe…
The Diameter of Sum Basic Equilibria Games
Aida Abiad, Carme Alvarez, Arnau Messegué
A graph of order is said to be a sum basic equilibrium if and only if for every edge from and any node from , when performing the swap of the edge for…
Distinguishing graphs by their spectra, Smith normal forms and complements
Aida Abiad, Carlos A. Alfaro, Ralihe R. Villagrán
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose compleme…
A switching method for constructing cospectral gain graphs
Aida Abiad, Francesco Belardo, Antonina P. Khramova
A gain graph over a group , also referred to as -gain graph, is a graph where an element of a group , called gain, is assigned to each oriented edge, in such a way that th…