|
gptkbp:instanceOf
|
gptkb:mathematical_concept
graph
|
|
gptkbp:alsoKnownAs
|
gptkb:hypercube_graph
|
|
gptkbp:application
|
coding theory
combinatorics
network topology
parallel computing
|
|
gptkbp:automorphismGroup
|
hyperoctahedral group
|
|
gptkbp:chromaticNumber
|
2
|
|
gptkbp:cliqueNumber
|
2
|
|
gptkbp:diameter
|
n
|
|
gptkbp:edge
|
n*2^{n-1}
|
|
gptkbp:edgeConnectivity
|
n
|
|
gptkbp:firstAppearance
|
20th century
|
|
gptkbp:girth
|
4
|
|
gptkbp:Hamiltonian
|
true
|
|
gptkbp:hasConnection
|
true
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
n-cube graph
|
|
gptkbp:independenceNumber
|
2^{n-1}
|
|
gptkbp:isBipartite
|
true
|
|
gptkbp:isCayleyGraph
|
true
|
|
gptkbp:isDistanceRegular
|
true
|
|
gptkbp:isEdgeTransitive
|
true
|
|
gptkbp:isRegular
|
true
|
|
gptkbp:isSelfComplementary
|
true for even n
|
|
gptkbp:isVertexInducedSubgraphOf
|
gptkb:(n+1)-cube_graph
|
|
gptkbp:isVertexTransitive
|
true
|
|
gptkbp:planar
|
true for n<=3, false for n>3
|
|
gptkbp:relatedTo
|
gptkb:Hamming_code
gptkb:algebra
gptkb:Gray_code
hypercube
|
|
gptkbp:symmetry
|
true
|
|
gptkbp:vertexConnectivity
|
n
|
|
gptkbp:vertexDegree
|
n
|
|
gptkbp:vertices
|
2^n
|
|
gptkbp:bfsParent
|
gptkb:hypercube_graph
|
|
gptkbp:bfsLayer
|
6
|