Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5134410> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Q5134410 subject Q8498914.
- Q5134410 subject Q8498915.
- Q5134410 abstract "In graph theory, a branch of mathematics, a clique-sum is a way of combining two graphs by gluing them together at a clique, analogous to the connected sum operation in topology. If two graphs G and H each contain cliques of equal size, the clique-sum of G and H is formed from their disjoint union by identifying pairs of vertices in these two cliques to form a single shared clique, and then possibly deleting some of the clique edges. A k-clique-sum is a clique-sum in which both cliques have at most k vertices. One may also form clique-sums and k-clique-sums of more than two graphs, by repeated application of the two-graph clique-sum operation.".
- Q5134410 thumbnail Clique-sum.svg?width=300.
- Q5134410 wikiPageExternalLink graphminoralgorithm.pdf.
- Q5134410 wikiPageWikiLink Q1028355.
- Q5134410 wikiPageWikiLink Q1052034.
- Q5134410 wikiPageWikiLink Q1128435.
- Q5134410 wikiPageWikiLink Q131476.
- Q5134410 wikiPageWikiLink Q1322892.
- Q5134410 wikiPageWikiLink Q1367055.
- Q5134410 wikiPageWikiLink Q1709878.
- Q5134410 wikiPageWikiLink Q184410.
- Q5134410 wikiPageWikiLink Q1890389.
- Q5134410 wikiPageWikiLink Q215206.
- Q5134410 wikiPageWikiLink Q230655.
- Q5134410 wikiPageWikiLink Q272735.
- Q5134410 wikiPageWikiLink Q2902363.
- Q5134410 wikiPageWikiLink Q2928101.
- Q5134410 wikiPageWikiLink Q3115543.
- Q5134410 wikiPageWikiLink Q3115621.
- Q5134410 wikiPageWikiLink Q3186905.
- Q5134410 wikiPageWikiLink Q42989.
- Q5134410 wikiPageWikiLink Q44337.
- Q5134410 wikiPageWikiLink Q5067368.
- Q5134410 wikiPageWikiLink Q5282038.
- Q5134410 wikiPageWikiLink Q547823.
- Q5134410 wikiPageWikiLink Q5597156.
- Q5134410 wikiPageWikiLink Q573901.
- Q5134410 wikiPageWikiLink Q621751.
- Q5134410 wikiPageWikiLink Q6295014.
- Q5134410 wikiPageWikiLink Q6295265.
- Q5134410 wikiPageWikiLink Q703577.
- Q5134410 wikiPageWikiLink Q7144893.
- Q5134410 wikiPageWikiLink Q7309609.
- Q5134410 wikiPageWikiLink Q7454787.
- Q5134410 wikiPageWikiLink Q761631.
- Q5134410 wikiPageWikiLink Q7621644.
- Q5134410 wikiPageWikiLink Q7661883.
- Q5134410 wikiPageWikiLink Q8498914.
- Q5134410 wikiPageWikiLink Q8498915.
- Q5134410 wikiPageWikiLink Q898572.
- Q5134410 wikiPageWikiLink Q905837.
- Q5134410 comment "In graph theory, a branch of mathematics, a clique-sum is a way of combining two graphs by gluing them together at a clique, analogous to the connected sum operation in topology. If two graphs G and H each contain cliques of equal size, the clique-sum of G and H is formed from their disjoint union by identifying pairs of vertices in these two cliques to form a single shared clique, and then possibly deleting some of the clique edges.".
- Q5134410 label "Clique-sum".
- Q5134410 depiction Clique-sum.svg.