{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\n**Hamming graphs** are a special class of [[graphs|00C0BR7D7H]] named after Richard Hamming and used in several branches of mathematics (graph theory) and computer science. Let $S$ be a [[set|0BSJ7RQ9BW]] of $q$ elements and $d$ a positive [[integer|0C4JS9RF5M]]. The Hamming graph $H(d,q)$ has vertex set $S^{d}$, the set of ordered $d$-[[tuples|9HFER6N708]] of elements of $S$, or sequences of length $d$ from $S$. Two vertices are [[adjacent|00C0BR7D7H]] if they differ in precisely one coordinate; that is, if their Hamming distance is one. The Hamming graph $H(d,q)$ is, equivalently, the Cartesian product of $d$ [[complete graphs|03WKB2H474]] $K_{q}$.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "156WJ7MRG3"
    ],
    "kind": "concept",
    "name": "Hamming graph",
    "same_as": {
      "wikidata": "Q369440",
      "wikipedia": "Hamming graph"
    },
    "sources": [
      {
        "locator": "Hamming graph",
        "mention": "wikipedia://en/8046549",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:8046549@r1317745629"
      }
    ],
    "tag": "X7W1JX98Z9"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/X7W1JX98Z9/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/X7W1JX98Z9.md",
  "msc": null,
  "name": "Hamming graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/X7W/X7W1JX98Z9.md",
  "status": null,
  "tag": "X7W1JX98Z9",
  "uri": "m2://X7W1JX98Z9",
  "url": "https://math2.tamnd.com/wiki/hamming-graph/",
  "writing": {
    "tag": "X7W1JX98Z9",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}