{
  "aliases": [
    "association-graph",
    "compatibility-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, the **modular product** of [[graphs|00C0BR7D7H]] $G$ and $H$ is a graph formed by combining $G$ and $H$ that has applications to subgraph isomorphism. It is one of several different kinds of graph products that have been studied, generally using the same vertex set (the [[Cartesian product|09CEDJYBKP]] of the [[sets|0BSJ7RQ9BW]] of vertices of the two graphs $G$ and $H$) but with different rules for determining which edges to include.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "association-graph",
      "compatibility-graph"
    ],
    "inventory": [
      "NS5X247AJG"
    ],
    "kind": "concept",
    "name": "Modular product of graphs",
    "same_as": {
      "wikidata": "Q6889729",
      "wikipedia": "Modular product of graphs"
    },
    "sources": [
      {
        "locator": "Modular product of graphs",
        "mention": "wikipedia://en/13518199",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:13518199@r1150891334"
      }
    ],
    "tag": "68TP7FFG4E"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/68TP7FFG4E/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/68TP7FFG4E.md",
  "msc": null,
  "name": "Modular product of graphs",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/68T/68TP7FFG4E.md",
  "status": null,
  "tag": "68TP7FFG4E",
  "uri": "m2://68TP7FFG4E",
  "url": "https://math2.tamnd.com/wiki/modular-product-of-graphs/",
  "writing": {
    "tag": "68TP7FFG4E",
    "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
      }
    ]
  }
}