Geodesic
\(P\)-polynomial weakly distance-regular digraphs
Qing Zeng ; Yuefeng Yang1 ; Kaishun Wang
1School of Science, China University of Geosciences, Beijing
The electronic journal of combinatorics, Tome 30 (2023) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/11798
Classification : 05E30, 05C12, 05C20
Mots-clés : attached scheme of a graph

Qing Zeng    ; Yuefeng Yang  1   ; Kaishun Wang 

1 School of Science, China University of Geosciences, Beijing 
@article{10_37236_11798,
     author = {Qing Zeng and Yuefeng Yang and Kaishun Wang},
     title = {\(P\)-polynomial weakly distance-regular digraphs},
     journal = {The electronic journal of combinatorics},
     year = {2023},
     volume = {30},
     number = {3},
     doi = {10.37236/11798},
     zbl = {1519.05262},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/11798/}
}
TY  - JOUR
AU  - Qing Zeng
AU  - Yuefeng Yang
AU  - Kaishun Wang
TI  - \(P\)-polynomial weakly distance-regular digraphs
JO  - The electronic journal of combinatorics
PY  - 2023
VL  - 30
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/11798/
DO  - 10.37236/11798
ID  - 10_37236_11798
ER  - 
%0 Journal Article
%A Qing Zeng
%A Yuefeng Yang
%A Kaishun Wang
%T \(P\)-polynomial weakly distance-regular digraphs
%J The electronic journal of combinatorics
%D 2023
%V 30
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/11798/
%R 10.37236/11798
%F 10_37236_11798
Qing Zeng; Yuefeng Yang; Kaishun Wang. \(P\)-polynomial weakly distance-regular digraphs. The electronic journal of combinatorics, Tome 30 (2023) no. 3. doi: 10.37236/11798

Cité par Sources :