Upper bounds for the independence polynomial of graphs at \(-1\)

DOI10.1007/s40840-021-01106-xzbMath1471.05049OpenAlexW3142810980MaRDI QIDQ2049008

Han Ren, Fayun Cao

Publication date: 24 August 2021

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-021-01106-x

zbMATH Keywords

cyclomatic numberindependence polynomialdecycling numbernon-\(\tilde{3}\)-cycles

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs
• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• Independence polynomials of some compound graphs
• A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
• The independence polynomial of rooted products of graphs
• Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory
• The cyclomatic number of a graph and its independence polynomial at \(- 1\)
• A note on the values of independence polynomials at \(-1\)
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds for the independence polynomial of graphs at \(-1\)