\(P\)-polynomial weakly distance-regular digraphs (Q6170519)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(P\)-polynomial weakly distance-regular digraphs |
scientific article; zbMATH DE number 7725119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(P\)-polynomial weakly distance-regular digraphs |
scientific article; zbMATH DE number 7725119 |
Statements
\(P\)-polynomial weakly distance-regular digraphs (English)
0 references
10 August 2023
0 references
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.
0 references
attached scheme of a graph
0 references
