The lower clique number ω_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the smallest term of the maximal clique polynomial, with the coefficient of the largest term being the usual (upper) clique number ω(G).

clique | clique number | maximal clique | maximal clique polynomial