{
  "aliases": [
    "graph-products"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **graph product** is a [[binary operation|0580ZJSA3Q]] on [[graphs|00C0BR7D7H]]. Specifically, it is an operation that takes two graphs $G_{1}$ and $G_{2}$ and produces a graph $H$ with the following properties:\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "graph-products"
    ],
    "inventory": [
      "Q3GR0B7PH3"
    ],
    "kind": "concept",
    "name": "Graph product",
    "same_as": {
      "wikidata": "Q569347",
      "wikipedia": "Graph product"
    },
    "sources": [
      {
        "locator": "Graph product",
        "mention": "wikipedia://en/11492935",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:11492935@r1322467415"
      }
    ],
    "tag": "SX0VR4PWFS"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/SX0VR4PWFS/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/SX0VR4PWFS.md",
  "msc": null,
  "name": "Graph product",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/SX0/SX0VR4PWFS.md",
  "status": null,
  "tag": "SX0VR4PWFS",
  "uri": "m2://SX0VR4PWFS",
  "url": "https://math2.tamnd.com/wiki/graph-product/",
  "writing": {
    "tag": "SX0VR4PWFS",
    "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
      }
    ]
  }
}