scientific article; zbMATH DE number 1123931
From MaRDI portal
Publication:4378285
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.
Recommendations
Cited in
(10)- Clique polynomials and independent set polynomials of graphs
- On the roots of independence polynomials of almost all very well-covered graphs
- On a class of polynomials associated with the cliques in a graph and its applications
- Clique polynomials have a unique root of smallest modulus
- scientific article; zbMATH DE number 4033780 (Why is no real title available?)
- Clique polynomials of 2-connected K₅-free chordal graphs
- Clique roots of K₄-free chordal graphs
- Independence equivalence classes of paths and cycles
- Monophonic polynomial of the join of graphs
- Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378285)
