On the unimodality of independence polynomial of certain classes of graphs

Abstract

The independence polynomial of a graph G is the polynomial $sum i_kx^k$, where $i_k$ denote the number of independent sets of cardinality k in G. In this paper we study unimodality problem for the independence polynomial of certain classes of graphs.

Keywords

• Independence polynomial
• Unimodality
• Log-concave
• Polyphenyl hexagonal chains