There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three (Q1011512): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.009 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150308403 / rank | |||
Revision as of 05:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three |
scientific article |
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
