On the dependence polynomial of a graph

DOI10.1016/J.EJC.2005.07.015zbMATH Open1110.05036OpenAlexW2089276257MaRDI QIDQ854836FDOQ854836

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

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

zbMATH Keywords

line graphmatching polynomialclique polynomialMöbius inversion

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Matching theory
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Dependence polynomials
• Title not available (Why is that?)
• Clique polynomials and independent set polynomials of graphs
• Clique polynomials have a unique root of smallest modulus
• Bounding the roots of independence polynomials.

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)