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

DOI10.1016/J.JCTB.2011.12.003MaRDI QIDQ412167zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The roots of the independence polynomial of a clawfree graph
• Clique polynomials and independent set polynomials of graphs
• On the coefficients of the independence polynomial of graphs
• On the maximal independence polynomial of certain graph configurations
• On the matching and permanental polynomials of graphs
• On the independence polynomials of path-like graphs
• On the matching polynomial of hypergraphs
• scientific article; zbMATH DE number 4051682
• A Pfaffian formula for matching polynomials of outerplanar graphs

Cites work

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

Cited in

(6)

• Laplacian matching polynomial of graphs
• Independence polynomials and Alexander-Conway polynomials of plumbing links
• Generalizations of the matching polynomial to the multivariate independence polynomial
• Upper bounds for the independence polynomial of graphs at \(-1\)
• The roots of the independence polynomial of a clawfree graph
• Christoffel-Darboux type identities for the independence polynomial

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)