Neighbour-transitive codes in Johnson graphs (Q2510649)
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 6324333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbour-transitive codes in Johnson graphs |
scientific article; zbMATH DE number 6324333 |
Statements
Neighbour-transitive codes in Johnson graphs (English)
0 references
1 August 2014
0 references
codes in graphs
0 references
Johnson graph
0 references
2-transitive permutation group
0 references
neighbour-transitive
0 references
0.9178088307380676
0 references
0.8456999659538269
0 references
0.8443270921707153
0 references
0.8200007081031799
0 references
0.8163745999336243
0 references
