P$-Polynomial Weakly Distance-Regular Digraphs

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.

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 30; no. 3
Main Authors Zeng, Qing, Yang, Yuefeng, Wang, Kaishun
Format Journal Article
LanguageEnglish
Published 14.07.2023
Online AccessGet full text

Cover

Loading…