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

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

the Cartesian product of two sets A and B, denoted A × B, is the set of all ordered pairs (a, b) where a is an element of A and b is an element of B. In...

bound of Vizing's conjecture, an unproven inequality between the domination number of the graphs in a different graph product, the cartesian product of graphs...

in graph theory. The strong product of any two graphs can be constructed as the union of two other products of the same two graphs, the Cartesian product...

known as the Cartesian product of graphs: it involves two graphs connecting the pair of vertices with an edge to form a new graph. In the case of the cubical...

a wheel graph on n vertices. Unsolved problem in mathematics Is the pebbling number of a Cartesian product of graphs at most the product of the pebbling...

mathematics In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture...

new graph from two initial ones, such as: disjoint union of graphs, cartesian product of graphs, tensor product of graphs, strong product of graphs, lexicographic...

the box topology The cartesian product of graphs This disambiguation page lists articles associated with the title Box product. If an internal link led...

product of two sets Cartesian product of graphs, a binary operation on graphs Cartesian tree, a binary tree in computer science Cartesian anxiety, a hope...

Cartesian coordinate system (UK: /kɑːrˈtiːzjən/, US: /kɑːrˈtiːʒən/) in a plane is a coordinate system that specifies each point uniquely by a pair of...

such as the Cartesian product of a number of complete graphs. A common type of lattice graph (known under different names, such as grid graph or square...

is one. The Hamming graph H(d,q) is, equivalently, the Cartesian product of d complete graphs Kq. In some cases, Hamming graphs may be considered more...

Descartes) Cartesian plane Cartesian product Cartesian product of graphs Cartesian theater Cartesian tree Descartes (crater) and Highlands on the Moon (Apollo...

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

the Cartesian product of graphs is a connected graph that is not itself a product. Every connected graph can be uniquely factored into a Cartesian product...

graph theory, the lexicographic product or (graph) composition G ∙ H of graphs G and H is a graph such that the vertex set of G ∙ H is the cartesian product...

In graph theory, the modular product of graphs G and H is a graph formed by combining G and H that has applications to subgraph isomorphism. It is one...

be hit by a set of at most 2 ν {\displaystyle 2\nu } edges? Vizing's conjecture on the domination number of cartesian products of graphs Zarankiewicz problem:...

product Cartesian product of sets Direct product of groups Semidirect product Product of group subsets Wreath product Free product Zappa–Szép product...

Cartesian closed if, roughly speaking, any morphism defined on a product of two objects can be naturally identified with a morphism defined on one of...

the Cartesian product of sets, the direct product of groups or rings, and the product of topological spaces. Essentially, the product of a family of objects...

a direct product of objects already known can often be defined by giving a new one. That induces a structure on the Cartesian product of the underlying...

of mathematics, a pullback (also called a fiber product, fibre product, fibered product or Cartesian square) is the limit of a diagram consisting of two...

numbers, these pairs are Cartesian coordinates of points in a plane and often form a curve. The graphical representation of the graph of a function is also...

-vertex graph G {\displaystyle G} has an odd cycle transversal of size k {\displaystyle k} , if and only if the Cartesian product of graphs G ◻ K 2 {\displaystyle...

dot product of the Cartesian coordinates of two vectors is widely used. It is often called the inner product (or rarely the projection product) of Euclidean...

matrices of two graphs is the adjacency matrix of the Cartesian product graph. The Kronecker product can be used to get a convenient representation for...

used in classical graph algorithms Labeled graphs associate labels to each vertex and/or edge of a graph. Matched with attributed graphs, these labels correspond...