Weakly distance-regular digraphs of diameter 2

2025/07/15 by Wang, Xiangli, Yuefeng Yang, Yang, Yuefeng
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.2507.11298

openalex publication_date 2025/07/15 · openalex created_date 2025/10/08 · openalex updated_date 2026/07/28

Abstract

Weakly distance-regular digraphs is a directed version of distance-regular graphs. In this paper, we characterize all weakly distance-regular digraphs of diameter 2.

Citations

• Semicomplete multipartite weakly distance-regular digraphs
• Locally semicomplete weakly distance-regular digraphs
• Weakly distance-regular circulants, I
• Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
• P-polynomial weakly distance-regular digraphs
• Weakly distance-regular digraphs of one type of arcs
• Thick weakly distance-regular digraphs
• Weakly distance-regular digraphs of valency three, II
• Quasi-thin weakly distance-regular digraphs
• Weakly distance-regular digraphs of valency three, I

Related

• Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
• Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
• Quasi-thin weakly distance-regular digraphs
• Weakly distance-regular digraphs whose attached association schemes are regular
• Weakly distance-regular digraphs of valency three, I