Given two graphs G and H , assume that C = { C 1 , C 2 , ? , C q } is a clique cover of G and U is a subset of V ( H ) . We introduce a new graph operation called the clique cover product, denoted by G C ? H U , as follows: for each clique C i ? C , add a copy of the graph H and join every vertex of C i to every vertex of U . We prove that the independence polynomial of G C ? H U I ( G C ? H U ; x ) = I ( H ; x ) q I ( G ; x I ( H - U ; x ) I ( H ; x ) ) , which generalizes some known results on independence polynomials of the compound graph introduced by Song, Staton and Wei, the corona and rooted products of graphs obtained by Gutman and Rosenfeld, respectively. Based on this formula, we show that the clique cover product of some graphs preserves symmetry, unimodality, log-concavity or reality of zeros of independence polynomials. As applications we derive several known facts and solve some open unimodality conjectures and problems in a simple and unified manner.
['Bao-Xuan Zhu']
Clique cover products and unimodality of independence polynomials