On a class of polynomials associated with the cliques in a graph and its applications (Q2639073)
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 4183454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a class of polynomials associated with the cliques in a graph and its applications |
scientific article; zbMATH DE number 4183454 |
Statements
On a class of polynomials associated with the cliques in a graph and its applications (English)
0 references
1989
0 references
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.
0 references
graph
0 references
decomposition
0 references
generating function
0 references
weights
0 references
F-polynomial
0 references
proper complete graph
0 references
proper cover
0 references
matching polynomial
0 references
clique polynomial
0 references
decompositions of finite sets
0 references
0.8303478360176086
0 references
