On a class of polynomials associated with the Cliques in a graph and its applications

E. J. Farrell

International Journal of Mathematics and Mathematical Sciences, 1989, vol. 12, 1-8

Abstract:

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 Menon are related to clique polynomials. This establishes a connection between the clique polynomial and decompositions of finite sets, symmetric groups and analysis.

Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/12/921637.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/12/921637.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:921637

DOI: 10.1155/S0161171289000104

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().