---
tag: 68TP7FFG4E
kind: concept
name: Modular product of graphs
aliases: [association-graph, compatibility-graph]
sources:
  - wikipedia: en:13518199@r1150891334
    locator: Modular product of graphs
    note: adopted
    mention: wikipedia://en/13518199
    sections: [Summary]
same_as:
  wikidata: Q6889729
  wikipedia: Modular product of graphs
inventory: [NS5X247AJG]
---

## Summary

In 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.