论文信息 - A note on purely imaginary independence roots

A note on purely imaginary independence roots

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each cardinality and its roots are called independence roots. We investigate here purely imaginary independence roots. We show that there are infinitely many connected graphs with purely imaginary independence roots and that every graph is a subgraph of such a graph. We also classify every rational purely imaginary number that is an independence root.

Jason I. Brown | Ben Cameron

[1] Ferenc Bencs,et al. On trees with real-rooted independence polynomial , 2017, Discret. Math..

[2] Jason I. Brown,et al. Maximum Modulus of Independence Roots of Graphs and Trees , 2020, Graphs Comb..

[3] Adam Bohn. A dense set of chromatic roots which is closed under multiplication by positive integers , 2014, Discret. Math..

[4] Péter Csikvári. Note on the Smallest Root of the Independence Polynomial , 2013, Comb. Probab. Comput..

[5] Jason I. Brown,et al. On the Stability of Independence Polynomials , 2018, Electron. J. Comb..

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

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

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

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