Graph product

In graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs and and produces a graph with the following properties:
* The vertex set of is the Cartesian product , where and are the vertex sets of and , respectively.
* Two vertices and of are connected by an edge, iff a condition about in and in is fulfilled.

The graph products differ in what exactly this condition is. It is always about whether or not the vertices in are equal or connected by an edge.

The terminology and notation for specific graph products in the literature varies quite a lot; even if the following may be considered somewhat standard, readers are advised to check what definition a particular author uses for a graph product, especially in older texts.

Overview table

The following table shows the most common graph products, with $\sim$ denoting "is connected by an edge to", and $\not\sim$ denoting non-connection. The operator symbols listed here are by no means standard, especially in older papers.

In general, a graph product is determined by any condition for $(a_1, a_2) \sim (b_1, b_2)$ that can be expressed in terms of $a_n = b_n$ and $a_n \sim b_n$.

Mnemonic

Let $K_2$ be the complete graph on two vertices (i.e. a single edge). The product graphs $K_2 \square K_2$, $K_2 \times K_2$, and $K_2 \boxtimes K_2$ look exactly like the graph representing the operator. For example, $K_2 \square K_2$ is a four cycle (a square) and $K_2 \boxtimes K_2$ is the complete graph on four vertices. The G_1 _2/math> notation for lexicographic product serves as a reminder that this product is not commutative.

See also

* Graph operations

Notes

References

*
{{refend