Extremal 1-codes in distance-regular graphs of diameter 3 (Q438900): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10623-012-9651-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082746365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shilla distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of \(P\)- and \(Q\)-polynomial association schemes / rank
 
Normal rank

Latest revision as of 11:56, 5 July 2024

scientific article
Language Label Description Also known as
English
Extremal 1-codes in distance-regular graphs of diameter 3
scientific article

    Statements

    Extremal 1-codes in distance-regular graphs of diameter 3 (English)
    0 references
    0 references
    0 references
    31 July 2012
    0 references
    distance-regular graphs
    0 references
    1-codes
    0 references
    Krein condition
    0 references
    triple intersection numbers
    0 references
    nonexistence
    0 references
    algebraic combinatorics
    0 references

    Identifiers