Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Tensor product of graphs
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, the tensor product <i>G</i> × <i>H</i> of <a href="/facts/Graph_(discrete_mathematics)/kw3eIBUe">graphs</a> G and H is a graph such that </p> <ul><li>the <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertex</a> set of <i>G</i> × <i>H</i> is the <a href="/facts/Cartesian_product/BfqBWzdL">Cartesian product</a> <i>V</i>(<i>G</i>) × <i>V</i>(<i>H</i>); and</li> <li>vertices (<i>g</i>,<i>h</i>) and (<i>g'</i>,<i>h' </i>) are adjacent in <i>G</i> × <i>H</i> <a href="/facts/If_and_only_if/bYSxGJ66">if and only if</a> <ul><li>g is adjacent to g' in G, and</li> <li>h is adjacent to h' in H.</li></ul></li></ul> <p>The tensor product is also called the direct product, Kronecker product, categorical product, cardinal product, relational product, weak direct product, or conjunction. As an operation on binary relations, the tensor product was introduced by <a href="/facts/Alfred_North_Whitehead/7KuylmP3">Alfred North Whitehead</a> and <a href="/facts/Bertrand_Russell/SRpwNX2U">Bertrand Russell</a> in their <a href="/facts/Principia_Mathematica/7ufeceV4">Principia Mathematica</a> (1912). It is also equivalent to the <a href="/facts/Kronecker_product/gABGx6I6">Kronecker product</a> of the <a href="/facts/Adjacency_matrix/jYXNhYGs">adjacency matrices</a> of the graphs. </p><p>The notation <i>G</i> × <i>H</i> is also (and formerly normally was) used to represent another construction known as the <a href="/facts/Cartesian_product_of_graphs/wC4JJdyU">Cartesian product of graphs</a>, but nowadays more commonly refers to the tensor product. The cross symbol shows visually the two edges resulting from the tensor product of two edges. This product should not be confused with the <a href="/facts/Strong_product_of_graphs/aawyyHwy">strong product of graphs</a>. </p>