Tight 2-designs and perfect 1-codes in Doob graphs (Q1569871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1471128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight 2-designs and perfect 1-codes in Doob graphs |
scientific article; zbMATH DE number 1471128 |
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.86908358335495
0 references
0.8343232870101929
0 references
0.8153801560401917
0 references
0.7891847491264343
0 references
0.767005205154419
0 references
