Quasi-thin weakly distance-regular digraphs

2016/09/16 by Yuefeng Yang, Yang, Yuefeng, Benjian Lv +3 · 1 citation
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.1609.04962

openalex publication_date 2016/09/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Weakly distance-regular digraphs of diameter 2
• Weakly distance-regular digraphs of valency three, I

Related

• Quasi-thin weakly distance-regular digraphs,I
• Weakly distance-regular digraphs of valency three, I
• Thick weakly distance-regular digraphs
• Weakly distance-regular digraphs of valency three, II
• Weakly distance-regular digraphs of diameter 2