On a class of polynomials associated with the cliques in a graph and its applications (Q2639073): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054278399 / rank
 
Normal rank

Latest revision as of 10:50, 30 July 2024

scientific article
Language Label Description Also known as
English
On a class of polynomials associated with the cliques in a graph and its applications
scientific article

    Statements

    On a class of polynomials associated with the cliques in a graph and its applications (English)
    0 references
    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

    Identifiers