Thick weakly distance-regular digraphs

2020/03/18 by Yuefeng Yang, Yang, Yuefeng, Kaishun Wang +1 · 1 citation
Computer Science · Mathematics · #05E30 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.2003.08053

openalex publication_date 2020/03/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A weakly distance-regular digraph is thick if its attached scheme is regular. In this paper, we show that each commutative thick weakly distance-regular digraph has a thick weakly distance-regular subdigraph such that the corresponding quotient digraph falls into six families of thick weakly distance-regular digraphs up to isomorphism.

Cited by

• Weakly distance-regular digraphs of diameter 2

Related

• Quasi-thin weakly distance-regular digraphs
• Quasi-thin weakly distance-regular digraphs,I
• P-polynomial weakly distance-regular digraphs
• Weakly distance-regular digraphs whose attached association schemes are regular
• Weakly distance-regular digraphs whose underlying graphs are distance-regular, I