Quasi-thin weakly distance-regular digraphs

Abstract

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3. As a result, this family of digraphs are completely determined.

arXiv admin note: substantial text overlap with arXiv:1606.03521

References in corpus (1)

• Weakly distance-regular digraphs of valency three, I

Cited by in corpus (2)

• Weakly distance-regular digraphs of valency three, I
• On 3-equivalenced weakly distance-regular digraphs