Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cartesian_product_of_graphs> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Cartesian_product_of_graphs abstract "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 any two vertices (u,u') and (v,v') are adjacent in G H if and only if either u = v and u' is adjacent with v' in H, or u' = v' and u is adjacent with v in G.Cartesian product graphs can be recognized efficiently, in time O(m log n) for a graph with m edges and n vertices (Aurenhammer, Hagauer & Imrich 1992). The operation is commutative as an operation on isomorphism classes of graphs, and more strongly the graphs G H and H G are naturally isomorphic, but it is not commutative as an operation on labeled graphs. The operation is also associative, as the graphs (F G) H and F (G H) are naturally isomorphic.The notation G × H is occasionally also used for Cartesian products of graphs, but is more commonly used for another construction known as the tensor product of graphs. The square symbol is the more common and unambiguous notation for the Cartesian product of graphs. It shows visually the four edges resulting from the Cartesian product of two edges.The Cartesian product is not a product in the category of graphs. (The tensor product is the categorical product.) However, it is a product in the category of reflexive graphs. The category of graphs does form a monoidal category under the Cartesian product.".
- Cartesian_product_of_graphs thumbnail Graph-Cartesian-product.svg?width=300.
- Cartesian_product_of_graphs wikiPageID "2856852".
- Cartesian_product_of_graphs wikiPageRevisionID "600584603".
- Cartesian_product_of_graphs hasPhotoCollection Cartesian_product_of_graphs.
- Cartesian_product_of_graphs title "Graph Cartesian Product".
- Cartesian_product_of_graphs urlname "GraphCartesianProduct".
- Cartesian_product_of_graphs subject Category:Graph_products.
- Cartesian_product_of_graphs type Artifact100021939.
- Cartesian_product_of_graphs type Commodity103076708.
- Cartesian_product_of_graphs type GraphProducts.
- Cartesian_product_of_graphs type Merchandise103748886.
- Cartesian_product_of_graphs type Object100002684.
- Cartesian_product_of_graphs type PhysicalEntity100001930.
- Cartesian_product_of_graphs type Whole100003553.
- Cartesian_product_of_graphs comment "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 any two vertices (u,u') and (v,v') are adjacent in G H if and only if either u = v and u' is adjacent with v' in H, or u' = v' and u is adjacent with v in G.Cartesian product graphs can be recognized efficiently, in time O(m log n) for a graph with m edges and n vertices (Aurenhammer, Hagauer & Imrich 1992).".
- Cartesian_product_of_graphs label "Cartesian product of graphs".
- Cartesian_product_of_graphs label "Produit cartésien (graphe)".
- Cartesian_product_of_graphs sameAs Produit_cartésien_(graphe).
- Cartesian_product_of_graphs sameAs m.0875tl.
- Cartesian_product_of_graphs sameAs Q3406706.
- Cartesian_product_of_graphs sameAs Q3406706.
- Cartesian_product_of_graphs sameAs Cartesian_product_of_graphs.
- Cartesian_product_of_graphs wasDerivedFrom Cartesian_product_of_graphs?oldid=600584603.
- Cartesian_product_of_graphs depiction Graph-Cartesian-product.svg.
- Cartesian_product_of_graphs isPrimaryTopicOf Cartesian_product_of_graphs.
