๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs

โœ Scribed by Bodo Lass

Book ID
113698924
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
190 KB
Volume
102
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
โœ Haruo Hosoya; K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur

Clique polynomials and independent set p
Clique polynomials and independent set polynomials of graphs
โœ Cornelis Hoede; Xueliang Li ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 492 KB

This paper introduces two kinds of graph polynomials, clique polynomial and independent set polynomial. The paper focuses on expansions of these polynomials. Some open problems are mentioned.