On the dependence polynomial of a graph

DOI10.1016/J.EJC.2005.07.015MaRDI QIDQ854836zbMATH OpenOpenAlexFDO

Authors Yan Wang, Jianguo Qian, Andreas W. M. Dress

Publication date 7 December 2006

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2005.07.015

zbMATH Keywords

line graphmatching polynomialclique polynomialMöbius inversion

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Dependence polynomials
• Dependence polynomials of some graph operations
• scientific article; zbMATH DE number 975356
• Clique polynomials and independent set polynomials of graphs
• scientific article; zbMATH DE number 2188337

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• Bounding the roots of independence polynomials.
• Clique polynomials and independent set polynomials of graphs
• Clique polynomials have a unique root of smallest modulus
• Dependence polynomials
• Matching theory
• On the foundations of combinatorial theory I. Theory of M�bius Functions

Cited in

(5)

• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• Dependency Pairs and Polynomial Path Orders
• Dependence polynomials of some graph operations
• Dependence polynomials
• Julia set of some graphs using independence polynomials

This page was built for publication: On the dependence polynomial of a graph

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