Clique

Clique --- клика.

This is a subgraph [math]\displaystyle{ G[W] }[/math] induced by [math]\displaystyle{ W \subseteq V(G) }[/math] such that every pair of vertices is adjacent. The clique size of a clique [math]\displaystyle{ G[W] }[/math] is the number of vertices of [math]\displaystyle{ W }[/math]. The maximum clique size of a clique in [math]\displaystyle{ G }[/math], [math]\displaystyle{ \omega(G) }[/math], is called the clique number of [math]\displaystyle{ G }[/math]. The clique number [math]\displaystyle{ \Omega(G,w) }[/math] of a weighted graph is defined as the minimum weight of a clique in [math]\displaystyle{ G }[/math].