Distance-two labellings of Hamming graphs (Q1026152)
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 5569476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance-two labellings of Hamming graphs |
scientific article; zbMATH DE number 5569476 |
Statements
Distance-two labellings of Hamming graphs (English)
0 references
24 June 2009
0 references
channel assignment
0 references
\(L(j, k)\)-labelling
0 references
cyclic \(L(j, k)\)-labelling
0 references
no-hole \(L(j, k)\)-labelling
0 references
no-hole cyclic \(L(j, k)\)-labelling
0 references
\(\lambda \)-number
0 references
Hamming graph
0 references
0.893625795841217
0 references
0.8814754486083984
0 references
0.8592610359191895
0 references
0.8571376800537109
0 references
