On Real-rootedness of Independence Polynomials of Rooted Products of Graphs

An independent set in a graph G is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial AΣx^(|A|), where the sum is over all independent sets A of G. In 1987, Alavi,Malde, Schwenk and Erd os conjectured that the independence polynomial of any tree or forest is unimodal.Although this unimodality conjecture has attracted many researchers’ attention, it is still open. Recently, Basit and Galvin even asked a much stronger question whether the independence polynomial of every tree is ordered log-concave. Note that if a polynomial has only negative real zeros then it is ordered log-concave and unimodal.In this paper, we observe real-rootedness of independence polynomials of rooted products of graphs. We find some trees whose rooted product preserves real-rootedness of independence polynomials. In consequence, starting from any graph whose independence polynomial has only real zeros, we can obtain an infinite family of graphs whose independence polynomials have only real zeros. In particular, applying it to trees or forests, we obtain that their independence polynomials are unimodal and ordered log-concave.

Unimodality of Independence Polynomials of the Cycle Cover Product of Graphs

An independent set in a graph G is a set of pairwise non-adjacent vertices.Let ik(G)denote the number of independent sets of cardinality k in G.Then its generating function I(G;x)=∑^(α(G))^(k=0)ik(G)x^(k),is called the independence polynomial of G(Gutman and Harary,1983).In this paper,we introduce a new graph operation called the cycle cover product and formulate its independence polynomial.We also give a criterion for formulating the independence polynomial of a graph.Based on the exact formulas,we prove some results on symmetry,unimodality,reality of zeros of independence polynomials of some graphs.As applications,we give some new constructions for graphs having symmetric and unimodal independence polynomials.