Tight 2-designs and perfect 1-codes in Doob graphs (Q1569871)

From MaRDI portal
Revision as of 19:46, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127185659, #quickstatements; #temporary_batch_1722364966119)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Tight 2-designs and perfect 1-codes in Doob graphs
scientific article

    Statements

    Tight 2-designs and perfect 1-codes in Doob graphs (English)
    0 references
    13 September 2001
    0 references
    Doob graphs
    0 references
    distance-regular graphs
    0 references
    Hamming graphs
    0 references
    perfect 1-codes
    0 references
    tight 2-designs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers