There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three (Q1011512)

From MaRDI portal
Revision as of 05:04, 20 March 2024 by Maintenance script (talk | contribs) (rollbackEdits.php mass rollback)
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
    0 references
    0 references
    8 April 2009
    0 references
    0 references
    Q-polynomial association schemes
    0 references
    distance regular graphs
    0 references
    rank of firts idempotent
    0 references