(n+1)-dimensional Hamming cube
GPTKB entity
Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
graph |
| gptkbp:application |
coding theory
computer science combinatorics |
| gptkbp:automorphismGroup |
gptkb:symmetric_group_S_{n+1}
|
| gptkbp:degree |
n+1
|
| gptkbp:diameter |
n+1
|
| gptkbp:dimensions |
n+1
|
| gptkbp:edge |
(n+1)*2^n
|
| gptkbp:edgeDefinition |
vertices differ in exactly one coordinate
|
| gptkbp:embedding |
can be embedded in (n+1)-dimensional Euclidean space
|
| gptkbp:hasConnection |
true
|
| gptkbp:hasSpecialCase |
gptkb:Hamming_graph
|
| https://www.w3.org/2000/01/rdf-schema#label |
(n+1)-dimensional Hamming cube
|
| gptkbp:isBipartite |
true
|
| gptkbp:isDistanceRegular |
true
|
| gptkbp:isEdgeTransitive |
true
|
| gptkbp:isHypercube |
true
|
| gptkbp:isRegular |
true
|
| gptkbp:isVertexTransitive |
true
|
| gptkbp:vertexRepresentation |
binary strings of length n+1
|
| gptkbp:vertices |
2^(n+1)
|
| gptkbp:bfsParent |
gptkb:Hamming_cube
|
| gptkbp:bfsLayer |
6
|