Clique
In a Graph of 
Vertices, a subset of pairwise adjacentVertices is known as a clique. A clique is a fully connected subgraph of a given graph. Theproblem of finding the size of a clique for a given Graph is an NP-Complete Problem. The number of graphs on 
nodes having 3 cliques are 0, 0, 1, 4, 12, 31, 67, ... (Sloane's A005289).
References
Sloane, N. J. A. SequenceA005289/M3440in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.
- Legendre's Constant
- Legendre Series
- Legendre's Factorization Method
- Legendre's Formula
- Legendre's Quadratic Reciprocity Law
- Legendre Sum
- Legendre Symbol
- Legendre Transformation
- Lehmer Method
- Lehmer Number
- Lehmer-Schur Method
- Lehmer's Constant
- Lehmer's Formula
- Lehmer's Phenomenon
- Lehmer's Problem
- Lehmer's Theorem
- Lehmus' Theorem
- Leibniz Criterion
- Leibniz Harmonic Triangle
- Leibniz Identity
- Leibniz Integral Rule
- Leibniz Series
- Lemarié's Wavelet
- Lemma
- Lemniscate