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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150308403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two theorems concerning the Bannai-Ito conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical codes and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the diameter of distance. Regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imprimitive cometric association schemes: constructions and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting fields of association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imprimitive Q-polynomial association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Association schemes with multiple Q-polynomial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue multiplicities of highly symmetric graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:52, 1 July 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
    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
    0 references