Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:application |
coding theory
combinatorics network topology |
| gptkbp:automorphismGroup |
gptkb:wreath_product_of_symmetric_groups
|
| gptkbp:chromaticNumber |
q
|
| gptkbp:cliqueNumber |
q
|
| gptkbp:diameter |
n
|
| gptkbp:distance |
true
|
| gptkbp:distanceTransitive |
true
|
| gptkbp:edgeDefinition |
edges connect vertices that differ in exactly one coordinate
|
| gptkbp:edgeTransitive |
true
|
| gptkbp:girth |
4 (if q>2), 6 (if q=2, n>2)
|
| gptkbp:hasSpecialCase |
gptkb:Hamming_cube
gptkb:hypercube_graph |
| https://www.w3.org/2000/01/rdf-schema#label |
Hamming graph
|
| gptkbp:namedAfter |
gptkb:Richard_Hamming
|
| gptkbp:notation |
H(n,q)
|
| gptkbp:numberOfSides |
n*q^{n-1}*(q-1)/2
|
| gptkbp:regularity |
regular graph
|
| gptkbp:relatedTo |
gptkb:Hamming_distance
gptkb:hypercube_graph Cartesian product of graphs |
| gptkbp:vertexSet |
set of n-tuples over an alphabet of q symbols
|
| gptkbp:vertexTransitive |
true
|
| gptkbp:vertices |
q^n
|
| gptkbp:bfsParent |
gptkb:Richard_Hamming
|
| gptkbp:bfsLayer |
4
|