Log-concavity of independence polynomials of some kinds of trees

Bao-Xuan Zhu and Yun Chen

Applied Mathematics and Computation, 2019, vol. 342, issue C, 35-44

Abstract: 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)=∑k=0α(G)ik(G)xkis called the independence polynomial of G (Gutman and Harary, 1983).

Keywords: Log-concavity; Unimodality; Independence polynomials; Recurrence relations (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318308002
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:342:y:2019:i:c:p:35-44

DOI: 10.1016/j.amc.2018.09.028

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().