In general, a graph product of two graphs 
and 
is a new graph whose vertex set
is 
and where, for any two
vertices 
and 
in the product, the adjacency
of those two vertices is determined entirely by the adjacency (or equality, or non-adjacency)
of 
and 
, and that of 
and 
. There are 
cases to be decided (three possibilities for each,
with the case where both are equal eliminated) and thus there are 
different types of graph products that can be defined.
The most commonly used graph products, given by conditions sufficient and necessary for adjacency, are summarized in the following table (Hartnell and Rall 1998). Note that the terminology is not quite standardized, so these products may actually be referred to by different names by different sources (for example, the graph lexicographic product is also known as the graph composition; Harary 1994, p. 21). Many other graph products can be found in Jensen and Toft (1994); see also Hammack et al. (2016).
Graph products can be computed in the Wolfram Language using GraphProduct[G, H, type].
| graph product name | symbol | definition |
| graph Cartesian product |  | ( and  ) or ( and  ) |
| graph lexicographic product |  | ( ) or ( and  ) |
| graph strong product | ![G□AdjustmentBox[x, BoxMargins -> {{-0.65, 0.13913}, {-0.5, 0.5}}, BoxBaselineShift -> -0.1]H](/images/equations/GraphProduct/Inline21.svg) | (
and  )
or (
and  )
or (
and  ) |
| graph tensor product |  | (
and  ) |
