Clique Here by tandoor


Available to buy on…

In graph theory, a clique in an undirected graph G is a set of vertices V such that for every two vertices in V, there exists an edge connecting the two. Alternatively, a clique is a graph in which every vertex is connected to every other vertex in the graph. This is equivalent to saying that the subgraph induced by V is a complete graph. The size of a clique is the number of vertices it contains.

desktop tablet-landscape content-width tablet-portrait workstream-4-across phone-landscape phone-portrait