The independence polynomial of rooted products of graphs

A stable (or independent) set in a graph is a set of pairwise nonadjacent vertices thereof. The stability [email protected](G) is the maximum size of stable sets in a graph G. The independence polynomial of G is I(G;x)[email protected][email protected](G)s"kx^k=s"0+s"1x+s"2x^2+...+s"@a"("G")x^@a^(^G^)(s"[email protected]?1), where s"k is the number of stable sets of cardinality k in a graph G, and was defined by Gutman and Harary (1983) [13]. We obtain a number of formulae expressing the independence polynomials of two sorts of the rooted product of graphs in terms of such polynomials of constituent graphs. In particular, it enables us to build infinite families of graphs whose independence polynomials have only real roots.

[1]  Alan D. Sokal,et al.  On Dependency Graphs and the Lattice Gas , 2006, Combinatorics, Probability and Computing.

[2]  Vadim E. Levit,et al.  On Unimodality of Independence Polynomials of Some Well-Covered Trees , 2003, DMTCS.

[3]  Vadim E. Levit,et al.  Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs , 2006 .

[4]  Vadim E. Levit,et al.  Very well-covered graphs with log-concave independence polynomials , 2004 .

[5]  Richard P. Stanley,et al.  Graph colorings and related symmetric functions: ideas and applications A description of results, interesting applications, & notable open problems , 1998, Discret. Math..

[6]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[7]  Vadim E. Levit,et al.  The independence polynomial of a graph - a survey , 2005 .

[8]  Jason I. Brown,et al.  Bounding the Roots of Independence Polynomials , 2001, Ars Comb..

[9]  E. Farrell.  On F-polynomials of thistles , 1987 .

[10]  Vadim E. Levit,et al.  On the roots of independence polynomials of almost all very well-covered graphs , 2008, Discret. Appl. Math..

[11]  Xueliang Li,et al.  Clique polynomials and independent set polynomials of graphs , 1994, Discret. Math..

[12]  Brendan D. McKay,et al.  A new graph product and its spectrum , 1978, Bulletin of the Australian Mathematical Society.

[13]  D. G. Rogers,et al.  Products of graceful trees , 1980, Discret. Math..

[14]  A. Scott,et al.  The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma , 2003, cond-mat/0309352.

[15]  Jason I. Brown,et al.  On the Location of Roots of Independence Polynomials , 2004 .

[16]  Jason I. Brown,et al.  Roots of Independence Polynomials of Well Covered Graphs , 2000 .

[17]  Vadim E. Levit,et al.  Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture , 2006, Eur. J. Comb..

[18]  Jason I. Brown,et al.  Average independence polynomials , 2005, J. Comb. Theory, Ser. B.

[19]  D. Cvetkovic,et al.  Recent Results in the Theory of Graph Spectra , 2012 .

[20]  Vadim E. Levit,et al.  A Family of Well-Covered Graphs with Unimodal Independence Polynomials , 2003 .

[22]  Paul D. Seymour,et al.  The roots of the independence polynomial of a clawfree graph , 2007, J. Comb. Theory B.

[23]  Vladimir R. Rosenfeld.  The circuit polynomial of the restricted rooted product G(Gamma) of graphs with a bipartite core G , 2008, Discret. Appl. Math..