A family of graphs whose independence polynomials are both palindromic and unimodal

a stable (or independent) set in a graph is a set of pairwise non-adjacent vertices. The stability number α(G) is the size of a maximum stable set in the graph G. The independence polynomial of G is defined by I(G; x) = s ₀ + s₁x + s₂x² + ... + s _αx^α, α = α(G), where s_k equals the number of stable sets of cardinality k in G (I. Gutman and F. Harary 1983). In this paper, we build a family of graphs whose independence polynomials are palindromic and unimodal. We conjecture that all these polynomials are also log-concave.