Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Strong_product_of_graphs> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Strong_product_of_graphs abstract "In graph theory, the strong 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 distinct vertices (u,u') and (v,v') are adjacent in G × H if and only if: u is adjacent to v and u'=v', or u=v and u' is adjacent to v', or u is adjacent to v and u' is adjacent to v'The strong product is also called the normal product and AND product. It was first introduced by Sabidussi in 1960.".
- Strong_product_of_graphs wikiPageID "11494014".
- Strong_product_of_graphs wikiPageLength "2090".
- Strong_product_of_graphs wikiPageOutDegree "12".
- Strong_product_of_graphs wikiPageRevisionID "677621758".
- Strong_product_of_graphs wikiPageWikiLink Cartesian_product_of_graphs.
- Strong_product_of_graphs wikiPageWikiLink Category:Graph_products.
- Strong_product_of_graphs wikiPageWikiLink Gert_Sabidussi.
- Strong_product_of_graphs wikiPageWikiLink Glossary_of_graph_theory.
- Strong_product_of_graphs wikiPageWikiLink Graph_product.
- Strong_product_of_graphs wikiPageWikiLink Graph_theory.
- Strong_product_of_graphs wikiPageWikiLink If_and_only_if.
- Strong_product_of_graphs wikiPageWikiLink Independence_number.
- Strong_product_of_graphs wikiPageWikiLink Lovász_number.
- Strong_product_of_graphs wikiPageWikiLink László_Lovász.
- Strong_product_of_graphs wikiPageWikiLink Shannon_capacity_of_a_graph.
- Strong_product_of_graphs wikiPageWikiLink Tensor_product_of_graphs.
- Strong_product_of_graphs wikiPageWikiLinkText "Strong product of graphs".
- Strong_product_of_graphs wikiPageWikiLinkText "Strong product".
- Strong_product_of_graphs wikiPageWikiLinkText "Strong_product_of_graphs".
- Strong_product_of_graphs wikiPageWikiLinkText "strong graph product".
- Strong_product_of_graphs wikiPageWikiLinkText "strong product of graphs".
- Strong_product_of_graphs hasPhotoCollection Strong_product_of_graphs.
- Strong_product_of_graphs wikiPageUsesTemplate Template:Citation.
- Strong_product_of_graphs wikiPageUsesTemplate Template:Cite_book.
- Strong_product_of_graphs wikiPageUsesTemplate Template:Cite_journal.
- Strong_product_of_graphs wikiPageUsesTemplate Template:Mvar.
- Strong_product_of_graphs wikiPageUsesTemplate Template:Reflist.
- Strong_product_of_graphs subject Category:Graph_products.
- Strong_product_of_graphs hypernym Graph.
- Strong_product_of_graphs type Software.
- Strong_product_of_graphs type Product.
- Strong_product_of_graphs comment "In graph theory, the strong 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 distinct vertices (u,u') and (v,v') are adjacent in G × H if and only if: u is adjacent to v and u'=v', or u=v and u' is adjacent to v', or u is adjacent to v and u' is adjacent to v'The strong product is also called the normal product and AND product. It was first introduced by Sabidussi in 1960.".
- Strong_product_of_graphs label "Strong product of graphs".
- Strong_product_of_graphs sameAs m.0glslj7.
- Strong_product_of_graphs sameAs Q7624582.
- Strong_product_of_graphs sameAs Q7624582.
- Strong_product_of_graphs wasDerivedFrom Strong_product_of_graphs?oldid=677621758.
- Strong_product_of_graphs isPrimaryTopicOf Strong_product_of_graphs.