$P$-Polynomial Weakly Distance-Regular Digraphs

  • Qing Zeng
  • Yuefeng Yang
  • Kaishun Wang
DOI: https://doi.org/10.37236/11798

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.

Published
2023-07-14
How to Cite
Zeng, Q., Yang, Y., & Wang, K. (2023). $P$-Polynomial Weakly Distance-Regular Digraphs. The Electronic Journal of Combinatorics, 30(3), P3.3. https://doi.org/10.37236/11798
Issue
Volume 30, Issue 3 (2023)
Article Number
P3.3