On the dependence polynomial of a graph
From MaRDI portal
Publication:854836
DOI10.1016/j.ejc.2005.07.015zbMath1110.05036OpenAlexW2089276257MaRDI QIDQ854836
Yan Wang, Andreas W. M. Dress, Jian Guo Qian
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
Related Items (2)
Dependence polynomials of some graph operations ⋮ Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
Cites Work
- Clique polynomials have a unique root of smallest modulus
- Matching theory
- Clique polynomials and independent set polynomials of graphs
- Dependence polynomials
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Unnamed Item
- Unnamed Item
This page was built for publication: On the dependence polynomial of a graph
