Clique-sum
id:
clique-sum-194-13051089
title:
Clique-sum
text:
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 deleting all the clique edges or possibly deleting some of the clique edges. A k-clique-sum is a clique-su
brand slug:
wiki
category slug:
encyclopedia
description:
Gluing graphs at complete subgraphs
original url:
https://en.wikipedia.org/wiki/Clique-sum
date created:
date modified:
2023-09-09T01:36:17Z
main entity:
{"identifier":"Q5134410","url":"https://www.wikidata.org/entity/Q5134410"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/47/Clique-sum.svg","width":630,"height":630}
fields total:
13
integrity:
15