E. V. van Dam

activity

20102026

most citedDistance-regular graphs

186 citations · 405 across the 30 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015★ 8 cited

Distance-regular Cayley graphs with least eigenvalue $- 2$

Alireza Abdollahi, Edwin van Dam, Mojtaba Jazaeri

We classify the distance-regular Cayley graphs with least eigenvalue $- 2$ and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain trian…

math.CO2015★ 2 cited

Directed strongly walk-regular graphs

Edwin R. van Dam, Gholamreza Omidi

We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly $ℓ$ -walk-regular with $ℓ > 1$ if the number of walks of length $ℓ$ from a…

math.OC2015★ 18 cited

New bounds for the max- $k$ -cut and chromatic number of a graph

Edwin R. van Dam, Renata Sotirov

We consider several semidefinite programming relaxations for the max- $k$ -cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite program…

Distance-regular Cayley graphs with least eigenvalue −2

Directed strongly walk-regular graphs

New bounds for the max-k-cut and chromatic number of a graph

Distance-regular Cayley graphs with least eigenvalue $- 2$

New bounds for the max- $k$ -cut and chromatic number of a graph