12 citations · 40 across the 78 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014
Switched symplectic graphs and their 2-ranks
Aida Abiad, Willem H. Haemers
We apply Godsil-McKay switching to the symplectic graphs over with at least 63 vertices and prove that the 2-rank of (the adjacency matrix of) the graph increases af…
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…
math.CO2014★ 5 cited
Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs
A. Abiad, E. R. van Dam, M. A. Fiol
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the i…