Modular product of graphs
Summary
In graph theory, the modular product of graphs and is a graph formed by combining and 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 of the sets of vertices of the two graphs and ) but with different rules for determining which edges to include.
Further reading
- Wikipedia, page 13518199, revision 1150891334, Modular product of graphs. adopted
About this page
| Tag | 68TP7FFG4E |
|---|---|
| URI | m2://68TP7FFG4E |
| Aliases | association-graph, compatibility-graph |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.