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:
Published in | The Electronic journal of combinatorics Vol. 30; no. 3 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
14.07.2023
|
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!