{
  "aliases": [
    "de-bruijn-diagram",
    "de-bruijn-digraph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, an $n$-dimensional **De Bruijn graph** of $m$ symbols is a [[directed graph|0KFYGSHHF5]] representing overlaps between sequences of symbols. It has $m^{n}$ vertices, consisting of all possible length-$n$ sequences of the given symbols; the same symbol may appear multiple times in a sequence. For a [[set|0BSJ7RQ9BW]] of $m$ symbols $S = \\{s_{1}, \\ldots, s_{m}\\},$ the set of vertices is:\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "de-bruijn-diagram",
      "de-bruijn-digraph"
    ],
    "inventory": [
      "N47SH1FQGG"
    ],
    "kind": "concept",
    "name": "De Bruijn graph",
    "same_as": {
      "wikidata": "Q3066095",
      "wikipedia": "De Bruijn graph"
    },
    "sources": [
      {
        "locator": "De Bruijn graph",
        "mention": "wikipedia://en/2346823",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:2346823@r1368876410"
      }
    ],
    "tag": "T2W58MMTWB"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/T2W58MMTWB/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/T2W58MMTWB.md",
  "msc": null,
  "name": "De Bruijn graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/T2W/T2W58MMTWB.md",
  "status": null,
  "tag": "T2W58MMTWB",
  "uri": "m2://T2W58MMTWB",
  "url": "https://math2.tamnd.com/wiki/de-bruijn-graph/",
  "writing": {
    "tag": "T2W58MMTWB",
    "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
      }
    ]
  }
}