TOPICS
Search

Maximal Clique Polynomial


subjMathematics:Discrete Mathematics:Graph Theory:Cliques

The maximal clique polynomial C_G(x) for the graph G may be defined as the polynomial

 C_G(x)=sum_(k=omega_L(G))^(omega(G))c_kx^k,

where omega_L(G) is the lower clique number, omega(G) is the (upper) clique number, and the coefficient c_k of x_k is the number of maximal cliques in the graph G.


See also

Clique, Clique Number, Lower Clique Number, Maximal Clique

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Maximal Clique Polynomial." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MaximalCliquePolynomial.html

Subject classifications