Clique polynomial — кликовый полином.
Let be a finite, simple graph and let be a family of cliques. By a clique cover of we mean a spanning subgraph of , each component of which is a member of . With each element of we associate an indeterminate (or weight) and with each cover of we associate the weight
The clique polynomial of is then:
where the sum is taken over all the covers of and is the vector of indeterminates . If, for all , we set , then the resulting polynomial in the single variable is called a simple clique polynomial of .
Denote by the Stirling numbers of the second kind. Then
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.