P-polynomial weakly distance-regular digraphs

2022/10/28 by Zeng Qing, Zeng, Qing, Yuefeng Yang +3 · 1 citation
Mathematics · #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.2210.16121

openalex publication_date 2022/10/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A weakly distance-regular digraph is P-polynomial if its attached scheme is P-polynomial. In this paper, we characterize all P-polynomial weakly distance-regular digraphs.

Cited by

• Weakly distance-regular digraphs of diameter 2

Related

• Thick weakly distance-regular digraphs
• Weakly distance-regular digraphs of diameter 2
• Weakly distance-regular digraphs whose attached association schemes are regular
• Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
• Weakly distance-regular digraphs whose underlying graphs are distance-regular,II