The reviewed record of science sign in
Pith

arxiv: 2210.16121 · v2 · pith:5G3P7TPB · submitted 2022-10-28 · math.CO

P-polynomial weakly distance-regular digraphs

Qing Zeng , Yuefeng Yang , Kaishun Wang This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5G3P7TPBrecord.jsonopen to challenge →

classification math.CO
keywords polynomialdistance-regularweaklydigraphsattachedcharacterizedigraphscheme
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.