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

DOI10.1016/J.JCTB.2011.12.003zbMATH Open1239.05096OpenAlexW1996822859MaRDI QIDQ412167FDOQ412167

Bodo Lass

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.12.003

zbMATH Keywords

rootsHermite polynomialindependence polynomialmatching polynomialalgebra of set functionsclawfree graphsmehler formulamonomer dimer systemspartitions of sets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of monomer-dimer systems
• Problems in algebraic combinatorics
• Homogeneous multivariate polynomials with the half-plane property
• Roots of independence polynomials of well covered graphs
• Dependence polynomials
• On the location of roots of independence polynomials
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Acyclic orientations and the chromatic polynomial
• Clique polynomials and independent set polynomials of graphs
• Average independence polynomials
• On the numbers of independent \(k\)-sets in a claw free graph
• The roots of the independence polynomial of a clawfree graph
• A combinational proof of the Mehler formula
• Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids
• Hermite polynomials and a duality relation for matchings polynomials
• Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)
• The \(N\)-dimensional matching polynomial
• Bounding the roots of independence polynomials.
• On Dependency Graphs and the Lattice Gas
• Matching polynomials and duality
• Characteristic polynomials of nonnegative integral square matrices and clique polynomials
• On the dependence polynomial of a graph

Cited In (5)

• Christoffel–Darboux Type Identities for the Independence Polynomial
• Upper bounds for the independence polynomial of graphs at \(-1\)
• Laplacian matching polynomial of graphs
• Independence polynomials and Alexander-Conway polynomials of plumbing links
• Generalizations of the matching polynomial to the multivariate independence polynomial

Recommendations

• Clique polynomials and independent set polynomials of graphs 👍 👎
• On the independence polynomials of path-like graphs 👍 👎
• The roots of the independence polynomial of a clawfree graph 👍 👎
• On the maximal independence polynomial of certain graph configurations 👍 👎
• On the coefficients of the independence polynomial of graphs 👍 👎
• On the matching and permanental polynomials of graphs 👍 👎
• A Pfaffian formula for matching polynomials of outerplanar graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412167)