Global Information Lookup Global Information

Tensor product of graphs information


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.

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 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.[1]

The notation G × H is also (and formerly normally was) used to represent another construction known as the Cartesian product of graphs, 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.[2] This product should not be confused with the strong product of graphs.

  1. ^ Weichsel 1962.
  2. ^ Hahn & Sabidussi 1997.

and 24 Related for: Tensor product of graphs information

Request time (Page generated in 1.0667 seconds.)

Tensor product of graphs

Last Update:

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...

Word Count : 869

Tensor product

Last Update:

v\otimes w} is called the tensor product of v and w. An element of V ⊗ W {\displaystyle V\otimes W} is a tensor, and the tensor product of two vectors is sometimes...

Word Count : 8640

Cartesian product of graphs

Last Update:

In graph theory, the Cartesian 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...

Word Count : 1446

Strong product of graphs

Last Update:

the Cartesian product of graphs and the tensor product of graphs. An example of a strong product is the king's graph, the graph of moves of a chess king...

Word Count : 1316

Cartesian product

Last Update:

Cartesian product of graphs is not a product in the sense of category theory. Instead, the categorical product is known as the tensor product of graphs. Axiom...

Word Count : 2818

Graph product

Last Update:

graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H...

Word Count : 610

Tensor decomposition

Last Update:

In multilinear algebra, a tensor decomposition is any scheme for expressing a "data tensor" (M-way array) as a sequence of elementary operations acting...

Word Count : 755

Direct product

Last Update:

descriptions of redirect targets Tensor product of graphs – Operation in graph theory Orders on the Cartesian product of totally ordered sets – Order whose elements...

Word Count : 3024

Kronecker product

Last Update:

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...

Word Count : 6118

Graph homomorphism

Last Update:

and one loop at that vertex. The tensor product of graphs is the category-theoretic product and the exponential graph is the exponential object for this...

Word Count : 4800

Product

Last Update:

Seven-dimensional cross product Triple product, in vector calculus Tensor product Product topology Cap product Cup product Slant product Smash product Wedge sum (or...

Word Count : 246

Circulant graph

Last Update:

generally, in this case, the tensor product of graphs between any m- and n-vertex circulants is itself a circulant. Many of the known lower bounds on Ramsey...

Word Count : 1308

Covering graph

Last Update:

cover of G is the tensor product of graphs G × K2: If G is already bipartite, its bipartite double cover consists of two disjoint copies of G. A graph may...

Word Count : 1409

Bipartite double cover

Last Update:

as the tensor product of graphs, G × K2. It is also called the Kronecker double cover, canonical double cover or simply the bipartite double of G. It should...

Word Count : 1435

Tensor network

Last Update:

Tensor networks or tensor network states are a class of variational wave functions used in the study of many-body quantum systems. Tensor networks extend...

Word Count : 673

Graph operations

Last Update:

graph product: it is a commutative and associative operation (for unlabelled graphs), tensor graph product (or direct graph product, categorical graph product...

Word Count : 510

Ricci curvature

Last Update:

between the Ricci tensor and the matter content of the universe. Like the metric tensor, the Ricci tensor assigns to each tangent space of the manifold a...

Word Count : 5859

Dot product

Last Update:

Cross product Dot product representation of a graph Euclidean norm, the square-root of the self dot product Matrix multiplication Metric tensor Multiplication...

Word Count : 4274

Bertrand Russell

Last Update:

theory, and various areas of analytic philosophy. He was one of the early 20th century's prominent logicians and a founder of analytic philosophy, along...

Word Count : 14992

Knowledge graph embedding

Last Update:

representation of a knowledge graph's entities and relations while preserving their semantic meaning. Leveraging their embedded representation, knowledge graphs (KGs)...

Word Count : 6011

Cyclic group

Last Update:

other sets of generators as well. The Cayley graphs of cyclic groups with arbitrary generator sets are called circulant graphs. These graphs may be represented...

Word Count : 4113

Google Tensor

Last Update:

smartphone series in 2021, and were succeeded by the Tensor G2 chip in 2022 and G3 in 2023. Tensor has been generally well received by critics. Development...

Word Count : 2709

Angular velocity tensor

Last Update:

space is the time derivative of the angular displacement tensor, which is a second rank skew-symmetric tensor. This tensor Ω will have n(n−1)/2 independent...

Word Count : 2523

Crown graph

Last Update:

complete graph, as the tensor product Kn × K2, as the complement of the Cartesian direct product of Kn and K2, or as a bipartite Kneser graph Hn,1 representing...

Word Count : 1137

PDF Search Engine © AllGlobal.net