Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Lexicographic_product_of_graphs> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Lexicographic_product_of_graphs abstract "In 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 V(G) × V(H); and any two vertices (u,v) and (x,y) are adjacent in G ∙ H if and only if either u is adjacent with x in G or u = x and v is adjacent with y in H.If the edge relations of the two graphs are order relations, then the edge relation of their lexicographic product is the corresponding lexicographic order.The lexicographic product was first studied by Felix Hausdorff (1914). As Feigenbaum & Schäffer (1986) showed, the problem of recognizing whether a graph is a lexicographic product is equivalent in complexity to the graph isomorphism problem.".
- Lexicographic_product_of_graphs thumbnail Graph-lexicographic-product.svg?width=300.
- Lexicographic_product_of_graphs wikiPageID "6026731".
- Lexicographic_product_of_graphs wikiPageRevisionID "453501377".
- Lexicographic_product_of_graphs authorlink "Felix Hausdorff".
- Lexicographic_product_of_graphs first "Felix".
- Lexicographic_product_of_graphs hasPhotoCollection Lexicographic_product_of_graphs.
- Lexicographic_product_of_graphs last "Hausdorff".
- Lexicographic_product_of_graphs title "Graph Lexicographic Product".
- Lexicographic_product_of_graphs urlname "GraphLexicographicProduct".
- Lexicographic_product_of_graphs year "1914".
- Lexicographic_product_of_graphs subject Category:Graph_products.
- Lexicographic_product_of_graphs type Artifact100021939.
- Lexicographic_product_of_graphs type Commodity103076708.
- Lexicographic_product_of_graphs type GraphProducts.
- Lexicographic_product_of_graphs type Merchandise103748886.
- Lexicographic_product_of_graphs type Object100002684.
- Lexicographic_product_of_graphs type PhysicalEntity100001930.
- Lexicographic_product_of_graphs type Whole100003553.
- Lexicographic_product_of_graphs comment "In 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 V(G) × V(H); and any two vertices (u,v) and (x,y) are adjacent in G ∙ H if and only if either u is adjacent with x in G or u = x and v is adjacent with y in H.If the edge relations of the two graphs are order relations, then the edge relation of their lexicographic product is the corresponding lexicographic order.The lexicographic product was first studied by Felix Hausdorff (1914). ".
- Lexicographic_product_of_graphs label "Lexicographic product of graphs".
- Lexicographic_product_of_graphs sameAs m.0fl6_x.
- Lexicographic_product_of_graphs sameAs Q6537715.
- Lexicographic_product_of_graphs sameAs Q6537715.
- Lexicographic_product_of_graphs sameAs Lexicographic_product_of_graphs.
- Lexicographic_product_of_graphs wasDerivedFrom Lexicographic_product_of_graphs?oldid=453501377.
- Lexicographic_product_of_graphs depiction Graph-lexicographic-product.svg.
- Lexicographic_product_of_graphs isPrimaryTopicOf Lexicographic_product_of_graphs.