enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Tensor product of graphs - Wikipedia

    en.wikipedia.org/wiki/Tensor_product_of_graphs

    The tensor product of graphs. 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; vertices (g,h) and (g',h' ) are adjacent in G × H if and only if. g is adjacent to g' in G, and; h is adjacent to h' in H.

  3. Tensor product - Wikipedia

    en.wikipedia.org/wiki/Tensor_product

    The tensor product of two vector spaces is a vector space that is defined up to an isomorphism.There are several equivalent ways to define it. Most consist of defining explicitly a vector space that is called a tensor product, and, generally, the equivalence proof results almost immediately from the basic properties of the vector spaces that are so defined.

  4. Kronecker product - Wikipedia

    en.wikipedia.org/wiki/Kronecker_product

    In mathematics, the Kronecker product, sometimes denoted by ⊗, is an operation on two matrices of arbitrary size resulting in a block matrix.It is a specialization of the tensor product (which is denoted by the same symbol) from vectors to matrices and gives the matrix of the tensor product linear map with respect to a standard choice of basis.

  5. Graph product - Wikipedia

    en.wikipedia.org/wiki/Graph_product

    In graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G 1 and G 2 and produces a graph H with the following properties: The vertex set of H is the Cartesian product V ( G 1 ) × V ( G 2 ) , where V ( G 1 ) and V ( G 2 ) are the vertex sets of G 1 and G 2 , respectively.

  6. Hedetniemi's conjecture - Wikipedia

    en.wikipedia.org/wiki/Hedetniemi's_conjecture

    Here, the chromatic number of a directed graph is just the chromatic number of the underlying graph, but the tensor product has exactly half the number of edges (for directed edges g→g' in G and h→h' in H, the tensor product G × H has only one edge, from (g,h) to (g',h'), while the product of the underlying undirected graphs would have an ...

  7. Cartesian product of graphs - Wikipedia

    en.wikipedia.org/wiki/Cartesian_product_of_graphs

    The notation G × H has often been used for Cartesian products of graphs, but is now more commonly used for another construction known as the tensor product of graphs. The square symbol is intended to be an intuitive and unambiguous notation for the Cartesian product, since it shows visually the four edges resulting from the Cartesian product ...

  8. Product (category theory) - Wikipedia

    en.wikipedia.org/wiki/Product_(category_theory)

    In the category of groups, the product is the direct product of groups given by the Cartesian product with multiplication defined componentwise. In the category of graphs, the product is the tensor product of graphs. In the category of relations, the product is given by the disjoint union.

  9. Graph operations - Wikipedia

    en.wikipedia.org/wiki/Graph_operations

    tensor graph product (or direct graph product, categorical graph product, cardinal graph product, Kronecker graph product): it is a commutative and associative operation (for unlabelled graphs), zig-zag graph product; [3] graph product based on other products: rooted graph product: it is an associative operation (for unlabelled but rooted ...