Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap


You are here: irt.org | FOLDOC | clique

<mathematics> 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.

[Is this correct?]


Nearby terms: clipboard « Clipper « CLIPS « clique » CLISP » Clive Sinclair » CLIX

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb