A characterization of \(Q\)-polynomial distance-regular graphs (Q925003): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2007.08.034 / rank | |||
| Property / cites work | |||
| Property / cites work: Q3218140 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992965 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Problems in algebraic combinatorics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new inequality for distance-regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: LEONARD PAIRS AND THE ASKEY–WILSON RELATIONS / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2007.08.034 / rank | |||
Normal rank | |||
Latest revision as of 08:16, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of \(Q\)-polynomial distance-regular graphs |
scientific article |
Statements
A characterization of \(Q\)-polynomial distance-regular graphs (English)
0 references
29 May 2008
0 references
distance-regular graph
0 references
\(Q\)-polynomial
0 references
association scheme
0 references
