9 citations · 16 across the 23 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012
Spectral characterizations of almost complete graphs
Marc Cámara, Willem H. Haemers
We investigate when a complete graph with some edges deleted is determined by its adjacency spectrum. It is shown to be the case if the deleted edges form a matching, a compl…
math.CO2012★ 9 cited
Regular graphs with maximal energy per vertex
Edwin R. van Dam, Willem H. Haemers, Jack H. Koolen
We study the energy per vertex in regular graphs. For every k, we give an upper bound for the energy per vertex of a k-regular graph, and show that a graph attains the upper bound…
math.CO2012
An odd characterization of the generalized odd graphs
Edwin R. van Dam, Willem H. Haemers
We show that any connected regular graph with distinct eigenvalues and odd-girth is distance-regular, and in particular that it is a generalized odd graph.