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

DOI10.1155/S0161171289000104zbMath0718.05043OpenAlexW2054278399MaRDI QIDQ2639073

E. J. Farrell

Publication date: 1989

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/46562

zbMATH Keywords

weightsgraphdecompositiongenerating functionmatching polynomialclique polynomialF-polynomialproper coverdecompositions of finite setsproper complete graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Enumerative combinatorics (05A99)

Related Items (4)

More connections between the matching polynomial and the chromatic polynomial ⋮ On F-polynomials of thistles ⋮ Cluj polynomials ⋮ Omega polynomial and its use in nanostructure description

This page was built for publication: On a class of polynomials associated with the cliques in a graph and its applications