On 3-equivalenced weakly distance-regular digraphs

2017/05/02 by Yang, Yuefeng, Lv, Benjian, Wang, Kaishun
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1705.00798

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.

Related

• Weakly distance-regular digraphs whose attached association schemes are regular
• Primitive weakly distance-regular circulant digraphs
• Weakly distance-regular digraphs of valency three, II
• Thick weakly distance-regular digraphs
• Weakly distance-regular digraphs of valency three, I