(n-1)-dimensional Hamming cube
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
graph combinatorial structure |
| gptkbp:automorphismGroup |
gptkb:symmetric_group_S_{n-1}
|
| gptkbp:chromaticNumber |
2
|
| gptkbp:clique_number |
2
|
| gptkbp:connectedTo |
yes
|
| gptkbp:degree |
n-1
|
| gptkbp:diameter |
n-1
|
| gptkbp:dimensions |
n-1
|
| gptkbp:edge_definition |
vertices are adjacent if their binary strings differ in exactly one coordinate
|
| gptkbp:girth |
4 (for n-1 > 1)
|
| https://www.w3.org/2000/01/rdf-schema#label |
(n-1)-dimensional Hamming cube
|
| gptkbp:is_bipartite |
yes
|
| gptkbp:is_Cayley_graph |
yes
|
| gptkbp:is_distance-regular |
yes
|
| gptkbp:is_regular_graph |
yes
|
| gptkbp:is_subgraph_of |
gptkb:n-dimensional_Hamming_cube
|
| gptkbp:number_of_edges |
(n-1) * 2^(n-2)
|
| gptkbp:vertex_set |
all binary strings of length n-1
|
| gptkbp:vertices |
2^(n-1)
|
| gptkbp:bfsParent |
gptkb:Hamming_cube
|
| gptkbp:bfsLayer |
6
|