Weakly distance-regular digraphs of valency three, II

2016/11/23 by Yuefeng Yang, Yang, Yuefeng, Benjian Lv +3 · 1 citation
Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1611.07764

openalex publication_date 2016/11/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we classify commutative weakly distance-regular digraphs of valency 3 with girth more than 2 and one type of arcs. Combining [8, Theorem 1.2], [10, Theorem 1.3] and [11, Theorem 1], commutative weakly distanceregular digraphs of valency 3 are completely determined.

Cited by

• Weakly distance-regular digraphs of diameter 2

Related

• Weakly distance-regular digraphs of valency three, I
• Weakly distance-regular digraphs of one type of arcs
• Quasi-thin weakly distance-regular digraphs
• Quasi-thin weakly distance-regular digraphs,I
• Weakly distance-regular digraphs whose attached association schemes are regular