| has gloss | eng: 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 * any two vertices (u,u) and (v,v) are adjacent in G × H if and only if u is adjacent with v and u is adjacent with 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 (Weichsel 1962). |
