|
gptkbp:instanceOf
|
gptkb:mathematical_concept
graph
combinatorial structure
|
|
gptkbp:alsoKnownAs
|
gptkb:n-dimensional_hypercube
|
|
gptkbp:application
|
coding theory
computer science
combinatorics
parallel computing
|
|
gptkbp:automorphismGroup
|
hyperoctahedral group
|
|
gptkbp:chromaticNumber
|
2
|
|
gptkbp:containsSubgraph
|
gptkb:(n-1)-dimensional_Hamming_cube
|
|
gptkbp:degree
|
n
|
|
gptkbp:diameter
|
n
|
|
gptkbp:dimensions
|
n
|
|
gptkbp:edge
|
pair of vertices differing in exactly one bit
|
|
gptkbp:edgeCount
|
n*2^{n-1}
|
|
gptkbp:embedding
|
can be embedded in n-dimensional Euclidean space
|
|
gptkbp:girth
|
4 (for n>1)
|
|
gptkbp:hasConnection
|
true
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Hamming cube
|
|
gptkbp:isBipartite
|
true
|
|
gptkbp:isEdgeTransitive
|
true
|
|
gptkbp:isRegular
|
true
|
|
gptkbp:isVertexTransitive
|
true
|
|
gptkbp:measures
|
gptkb:Hamming_distance
|
|
gptkbp:namedAfter
|
gptkb:Richard_Hamming
|
|
gptkbp:planar
|
false (for n>3)
|
|
gptkbp:subgraphOf
|
gptkb:(n+1)-dimensional_Hamming_cube
|
|
gptkbp:vertices
|
2^n
binary string of length n
|
|
gptkbp:bfsParent
|
gptkb:Hamming_graph
|
|
gptkbp:bfsLayer
|
5
|