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 in	The Electronic journal of combinatorics Vol. 30; no. 3
Main Authors	Zeng, Qing, Yang, Yuefeng, Wang, Kaishun
Format	Journal Article
Language	English
Published	14.07.2023
Online Access	Get full text

Cover

Loading…

More Information
Summary:	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.
ISSN:	1077-8926 1077-8926
DOI:	10.37236/11798