In mathematics, a graph product is a certain kind of binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H with the following properties: The vertex set of H is the Cartesian product V(G1) × V(G2), where V(G1) and V(G2) are the vertex sets of G1 and G2, respectively. Two vertices (u1, u2) and (v1, v2) of H are connected by an edge if and only if the vertices u1, u2, v1, v2 satisfy conditions of a certain type (see below).

PropertyValue
dbpprop:abstract
  • In mathematics, a graph product is a certain kind of binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H with the following properties: The vertex set of H is the Cartesian product V(G1) × V(G2), where V(G1) and V(G2) are the vertex sets of G1 and G2, respectively. Two vertices (u1, u2) and (v1, v2) of H are connected by an edge if and only if the vertices u1, u2, v1, v2 satisfy conditions of a certain type (see below). The following table shows the most common graph products, with ∼ denoting “is connected by an edge to”: In general, a graph product is determined by any condition for (u1, u2) ∼ (v1, v2) that can be expressed in terms of the statements u1 ∼ v1, u2 ∼ v2, u1 = v1, and u2 = v2.
  • A gráfszorzás egy kétoperandusú gráfművelet. Több definíciója létezik.
dbpprop:hasPhotoCollection
rdf:type
rdfs:comment
  • In mathematics, a graph product is a certain kind of binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H with the following properties: The vertex set of H is the Cartesian product V(G1) × V(G2), where V(G1) and V(G2) are the vertex sets of G1 and G2, respectively. Two vertices (u1, u2) and (v1, v2) of H are connected by an edge if and only if the vertices u1, u2, v1, v2 satisfy conditions of a certain type (see below).
  • A gráfszorzás egy kétoperandusú gráfművelet. Több definíciója létezik.
rdfs:label
  • Graph product
  • Gráfszorzás
owl:sameAs
skos:subject
foaf:page
is dbpprop:redirect of
is owl:sameAs of