The lower clique number 
of a graph 
may be defined as the size of a smallest maximal
clique in a graph 
. 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 
.
Lower Clique Number
See also
Clique, Clique Number, Maximal Clique, Maximal Clique PolynomialExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Lower Clique Number." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LowerCliqueNumber.html