  A weakly distance-regular digraph is 3-equivalenced if its attached
association scheme is 3-equivalenced. In this paper, we classify the family of
such digraphs under the assumption of the commutativity.

Combinatorics