186 citations · 405 across the 30 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.OC2013★ 11 cited
Semidefinite programming and eigenvalue bounds for the graph partition problem
Edwin R. van Dam, Renata Sotirov
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining differ…
math.CO2013★ 8 cited
Geometric aspects of 2-walk-regular graphs
Marc Cámara, Edwin R. van Dam, Jack H. Koolen +1
A -walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this dist…