Monoid universality of distance-regular graphs

Determine whether distance-regular graphs can represent every finite monoid as an endomorphism monoid.

Background

After noting that strongly regular graphs cannot represent all monoids because they are core-complete, the paper considers the contrasting possibility that distance-regular graphs might nevertheless be universal for finite monoid representation. The authors explicitly leave this question unresolved.