No label defined (Q4378285)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1123931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1123931 |
Statements
4 March 1998
0 references
graph polynomials
0 references
clique polynomial
0 references
independence polynomial
0 references
threshold graphs
0 references
0.8338946104049683
0 references
0.7961143851280212
0 references
The clique polynomial \(C(G;x)\) of the graph \(G\) is defined as \[ C(G;x)=\sum_{k\geq 0}a_k(G)x^k \] where \(a_k\) is the number of \(k\)-cliques. Observe that \(C({\overline G};x)\) is the previously much studied independence polynomial. A characterization of the clique polynomials of threshold graphs is given. Within the class of all threshold graphs, each such graph is uniquely determined by its clique polynomial.
0 references