A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs

DOI10.1016/j.disc.2013.05.009zbMath1277.05124OpenAlexW2151503113MaRDI QIDQ385733

Bing Wei, John Estes, William Staton

Publication date: 3 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.05.009

zbMATH Keywords

\(k\)-degenerate graphs\(k\)-treesindependence polynomialsFibonacci number of a graph

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (1)

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

Cites Work

• The roots of the independence polynomial of a clawfree graph
• Independence polynomials of \(k\)-tree related graphs
• Clique polynomials and independent set polynomials of graphs
• The cyclomatic number of a graph and its independence polynomial at \(- 1\)
• The number of labeled k-dimensional trees
• k-Degenerate Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bound on the values of independence polynomials at \(-1/k\) for \(k\)-degenerate graphs