On a class of polynomials associated with the cliques in a graph and its applications
Summary: The clique polynomial of a graph is defined. An explicit formula is then derived for the clique polynomial of the complete graph. A fundamental theorem and a reduction process is then given for clique polynomials. Basic properties of the polynomial are also given. It is shown that the number theoretic functions defined by \textit{P. K. Menon} [J. Comb. Inf. Syst. Sci. 1, 112-121 (1976; Zbl 0429.05009)] are related to clique polynomials. This establishes a connection between the clique polynomial and decompositions of finite sets, symmetric groups and analysis.
- Cluj polynomials
- Omega polynomial and its use in nanostructure description
- Clique polynomials and independent set polynomials of graphs
- More connections between the matching polynomial and the chromatic polynomial
- Clique polynomials have a unique root of smallest modulus
- scientific article; zbMATH DE number 19199 (Why is no real title available?)
- scientific article; zbMATH DE number 1229629 (Why is no real title available?)
- scientific article; zbMATH DE number 1123931 (Why is no real title available?)
- scientific article; zbMATH DE number 2076811 (Why is no real title available?)
- scientific article; zbMATH DE number 2094520 (Why is no real title available?)
- scientific article; zbMATH DE number 798649 (Why is no real title available?)
- scientific article; zbMATH DE number 7312755 (Why is no real title available?)
- On the number of cliques and cycles in graphs
- On F-polynomials of thistles
- A Study on Homotopy Analysis Method and Clique Polynomial Method
- Graph polynomials: some questions on the edge
- Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials
This page was built for publication: On a class of polynomials associated with the cliques in a graph and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639073)
