MUHAMMAD RABIL FAISAL ROLL NO. 9688 (SEC.

B)
GRAPH PRODUCTS

Tensor Product :
In graph theory, the tensor product G × H of graphs G and H is a graph such that

❖ the vertex set of G × H is the Cartesian product V(G) × V(H); and

❖ distinct vertices (u,u' ) and (v,v' ) are adjacent in G × H if and only if
➢ u is adjacent to v and
➢ u' is adjacent to v' .
The tensor product is also called the direct product, categorical product, cardinal product, relational
product, Kronecker product, weak direct product, or conjunction. As an operation on binary relations, the
tensor product was introduced by Alfred North Whitehead and Bertrand Russell in their Principia
Mathematica (1912). It is also equivalent to the Kronecker product of the adjacency matrices of the graphs

Examples
❖ The tensor product G × K2 is a bipartite graph, called the bipartite double cover of G. The bipartite
double cover of the Petersen graph is the Desargues graph: K2 × G(5,2) = G(10,3). The bipartite double
cover of a complete graph Kn is a crown graph (a complete bipartite graph Kn,n minus a perfect
matching).
❖ The tensor product of a complete graph with itself is the complement of a Rook's graph. Its vertices can
be placed in an n by n grid, so that each vertex is adjacent to the vertices that are not in the same row or
column of the grid.
Lexicographic Product :
In graph theory, the lexicographic product or (graph) composition G ∙ H of graphs G and H is a graph such that

❖ the vertex set of G ∙ H is the cartesian product V(G) × V(H); and

❖ any two vertices (u,v) and (x,y) are adjacent in G ∙ H if and only if either u is adjacent
with x in G or u = x and v is adjacent with y in H.

If the edge relations of the two graphs are order relations, then the edge relation of their lexicographic
product is the corresponding lexicographic order.
The lexicographic product was first studied by Felix Hausdorff (1914). As Feigenbaum & Schäffer
(1986) showed, the problem of recognizing whether a graph is a lexicographic product is equivalent in
complexity to the graph isomorphism problem.
Strong Product :
In graph theory, the strong product G ⊠ H of graphs G and H is a graph such that[1]

❖ the vertex set of G ⊠ H is the Cartesian product V(G) × V(H); and

❖ distinct vertices (u,u' ) and (v,v' ) are adjacent in G ⊠ H if and only if:
➢ u = v and u' is adjacent to v' , or
➢ u' = v' and u is adjacent to v, or
➢ u is adjacent to v and u' is adjacent to v' .
It is the union of the Cartesian product and the tensor product.
The strong product is also called the normal product or the AND product.[citation needed] It was first
introduced by Sabidussi in 1960.[2] In that setting, the strong product is contrasted against a weak product,
but the two are different only when applied to infinitely many factors.
For example, the king's graph, a graph whose vertices are squares of a chessboard and whose edges
represent possible moves of a chess king, is a strong product of two path graphs.[3]
Care should be exercised when encountering the term strong product in the literature, since it has also been
used to denote the tensor .
Modular Product :
In graph theory, the modular product of graphs 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 of the sets of vertices of the
two graphs G and H) but with different rules for determining which edges to include.

The vertex set of the modular product of G and H is the cartesian product V(G) × V(H). Any two vertices (u, v)
and (u' , v' ) are adjacent in the modular product of G and H if and only if either

❖ u is adjacent with u' and v is adjacent with v' , or

❖ u is not adjacent with u' and v is not adjacent with v'
 Corona Product :
The corona product G ◦ H of two graphs G and H is obtained by taking one copy of G and |V (G)|
copies of H; and by joining each vertex of the i-th copy of H to the i-th vertex of G, where 1 ≤ i ≤ |V
(G)|. In this paper, exact formulas for the eccentric distance sum and the edge revised Szeged indices
of the corona product of graphs are presented. We also study the conditions under which the corona
product of graphs produces a median graph.

Rooted Product:

Replacement Product :
In graph theory, the replacement product of two graphs is a graph product that can be used to reduce
the degree of a graph while maintaining its connectivity.[1]
Suppose G is a d-regular graph and H is an e-regular graph with vertex set {0, …, d − 1}. Let R denote the
replacement product of G and H. The vertex set of R is the Cartesian product V(G) × V(H). For each
vertex u in V(G) and for each edge (i, j) in E(H), the vertex (u, i) is adjacent to (u, j) in R. Furthermore, for each
edge (u, v) in E(G), if v is the ith neighbor of u and u is the jth neighbor of v, the vertex (u, i) is adjacent to (v, j)
in R.
If H is an e-regular graph, then R is an (e + 1)-regular graph.
Overview table

Size (number of
edges)
Name Example
Condition for

Tensor product
(Categorical product) and

Lexicographical product u 1 ∼ v1
or
or ( u1 = v1 and u2 ∼ v2 )

Strong product ( u1 = v1 and u2 ∼ v2 )

(Normal product, AND or
product) ( u1 ∼ v1 and u2 = v2 )
or
( u1 ∼ v1 and u2 ∼ v2 )

Co-normal product
(disjunctive product, OR u 1 ∼ v1
product) or
u 2 ∼ v2

or
Modular product

Rooted product see article