On the unimodality of independence polynomials of some graphs

Authors:
Yi Wang;Bao-Xuan Zhu
Affiliations:
-;-
Venue:
European Journal of Combinatorics
Year:
2011

Citing 13
Cited 0

On the numbers of independent k-sets in a claw free graph

Journal of Combinatorial Theory Series B
Clique polynomials and independent set polynomials of graphs

Selected papers of the 13th British Combinatorial Conference on British combinatorial conference
Roots of Independence Polynomials of Well Covered Graphs

Journal of Algebraic Combinatorics: An International Journal
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Location of Roots of Independence Polynomials

Journal of Algebraic Combinatorics: An International Journal
Average independence polynomials

Journal of Combinatorial Theory Series B
Polynomials with real zeros and Pólya frequency sequences

Journal of Combinatorial Theory Series A
Proof of a conjecture on unimodality

European Journal of Combinatorics
Graph Theory With Applications

Graph Theory With Applications
Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture

European Journal of Combinatorics
Log-concavity and LC-positivity

Journal of Combinatorial Theory Series A
The roots of the independence polynomial of a clawfree graph

Journal of Combinatorial Theory Series B
Building Graphs Whose Independence Polynomials Have Only Real Roots

Graphs and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for certain classes of graphs. As applications we settle some unimodality conjectures and problems.