This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n16http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
dbpedia-huhttp://hu.dbpedia.org/resource/
n10https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n12http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Vadim_G._Vizing
dbo:wikiPageWikiLink
dbr:Modular_product_of_graphs
Subject Item
dbr:Clique_problem
dbo:wikiPageWikiLink
dbr:Modular_product_of_graphs
Subject Item
dbr:Graph_product
dbo:wikiPageWikiLink
dbr:Modular_product_of_graphs
Subject Item
dbr:Maximum_common_induced_subgraph
dbo:wikiPageWikiLink
dbr:Modular_product_of_graphs
Subject Item
dbr:Modular_product_of_graphs
rdf:type
yago:PhysicalEntity100001930 yago:Merchandise103748886 dbo:Software yago:WikicatGraphProducts yago:Artifact100021939 yago:Object100002684 yago:Commodity103076708 yago:Whole100003553
rdfs:label
Modular product of graphs
rdfs:comment
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 of several different kinds of graph products that have been studied, generally using the same vertex set (the Cartesian product of the sets of vertices of the two graphs G and H) but with different rules for determining which edges to include.
foaf:depiction
n12:Modular_product.png
dcterms:subject
dbc:Graph_products
dbo:wikiPageID
13518199
dbo:wikiPageRevisionID
1017979378
dbo:wikiPageWikiLink
dbr:Clique_(graph_theory) dbr:Clique_problem dbr:Maximum_clique dbr:Induced_subgraph dbr:Graph_isomorphism dbr:Graph_product n16:Modular_product.png dbr:Maximum_common_induced_subgraph dbr:Subgraph_isomorphism dbr:NP-complete dbr:Graph_theory dbc:Graph_products dbr:Cartesian_product
owl:sameAs
dbpedia-hu:Gráfok_moduláris_szorzata n10:4rdun wikidata:Q6889729 yago-res:Modular_product_of_graphs freebase:m.03c7ycq
dbp:wikiPageUsesTemplate
dbt:Citation
dbo:thumbnail
n12:Modular_product.png?width=300
dbo:abstract
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 of several different kinds of graph products that have been studied, generally using the same vertex set (the Cartesian product of the sets of vertices of the two graphs G and H) but with different rules for determining which edges to include.
gold:hypernym
dbr:Graph
prov:wasDerivedFrom
wikipedia-en:Modular_product_of_graphs?oldid=1017979378&ns=0
dbo:wikiPageLength
2682
foaf:isPrimaryTopicOf
wikipedia-en:Modular_product_of_graphs
Subject Item
dbr:Association_graph
dbo:wikiPageWikiLink
dbr:Modular_product_of_graphs
dbo:wikiPageRedirects
dbr:Modular_product_of_graphs
Subject Item
dbr:Compatibility_graph
dbo:wikiPageWikiLink
dbr:Modular_product_of_graphs
dbo:wikiPageRedirects
dbr:Modular_product_of_graphs
Subject Item
wikipedia-en:Modular_product_of_graphs
foaf:primaryTopic
dbr:Modular_product_of_graphs