 Strong product of graphs

Its vertices are pairs of vertices. Two distinct pairs are adjacent exactly when, in each coordinate, their entries are equal or adjacent in the corresponding graph. Cartesian products of independent sets are independent, giving supermultiplicativity of the independence number.

The strong product of two graphs \( G \) and \( H \), denoted as \( G \boxtimes H \), is a graph that combines the structures of both \( G \) and \( H \) in a way that incorporates features from both the Cartesian product and the tensor product of graphs.