Also found in: Dictionary, Thesaurus, Acronyms, Wikipedia.
In a graph, a complete subgraph of that graph.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
The following article is from The Great Soviet Encyclopedia (1979). It might be outdated or ideologically biased.
a group of people striving to achieve by any available means base, selfish aims (for example, a court clique or fascist clique).
The Great Soviet Encyclopedia, 3rd Edition (1970-1979). © 2010 The Gale Group, Inc. All rights reserved.
A maximal totally connected subgraph. Given a graph with nodes N, a clique C is a subset of N where every node in C is directly connected to every other node in C (i.e. C is totally connected), and C contains all such nodes (C is maximal). In other words, a clique contains all, and only, those nodes which are directly connected to all other nodes in the clique.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)