Clique (graph theory)

Adjacent subset of an undirected graph

In graph theory, a clique ( or) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. That is, a clique of a graph G {\displaystyle G} is an induced subgraph of G {\displaystyle G} that is complete. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs.

From Wikipedia, under CC BY-SA. More on occurri.