There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three (Q1011512)
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: There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three |
scientific article; zbMATH DE number 5541743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three |
scientific article; zbMATH DE number 5541743 |
Statements
There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three (English)
0 references
8 April 2009
0 references
Q-polynomial association schemes
0 references
distance regular graphs
0 references
rank of firts idempotent
0 references
0.8699304
0 references
0.86126536
0 references
0.8592824
0 references
0.8529771
0 references
0.85062885
0 references
0.8469808
0 references
0.8441277
0 references
