Pages that link to "Item:Q2049008"

The following pages link to Upper bounds for the independence polynomial of graphs at \(-1\) (Q2049008):

Displaying 7 items.

• A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs (Q385733) (← links)
• A simple proof of an inequality connecting the alternating number of independent sets and the decycling number (Q539877) (← links)
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph (Q1265892) (← links)
• An upper bound on the independence number of a graph computable in polynomial-time (Q1919180) (← links)
• The cyclomatic number of a graph and its independence polynomial at \(- 1\) (Q1950412) (← links)
• A note on the values of independence polynomials at \(-1\) (Q2629283) (← links)
• On the independence polynomial of an antiregular graph (Q2857162) (← links)