1 citations · 1 across the 4 of their papers we have counts for
1 paper · 2 filters
M. Cámara, C. Dalfó, C. Delorme +2
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give s…