Extremal 1-codes in distance-regular graphs of diameter 3 (Q438900)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extremal 1-codes in distance-regular graphs of diameter 3 |
scientific article; zbMATH DE number 6062575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal 1-codes in distance-regular graphs of diameter 3 |
scientific article; zbMATH DE number 6062575 |
Statements
Extremal 1-codes in distance-regular graphs of diameter 3 (English)
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
0 references
0.89648396
0 references
0.88067365
0 references
0.88040733
0 references
0 references
0.8678398
0 references
0 references
