On 3-equivalenced weakly distance-regular digraphs

Abstract

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.

The main theorem of this paper can be proved by other paper's result easily

References in corpus (2)

• Weakly distance-regular digraphs of valency three, I
• Quasi-thin weakly distance-regular digraphs

Cited by in corpus (1)

• Weakly distance-regular digraphs whose attached association schemes are regular