Unimodality of the independence polynomials of non-regular caterpillars

From MaRDI portal
(Redirected from Publication:4616097)




Abstract: The independence polynomial I(G,x) of a graph G is the polynomial in variable x in which the coefficient an on xn gives the number of independent subsets SsubseteqV(G) of vertices of G such that |S|=n. I(G,x) is unimodal if there is an index mu such that that a0leqa1leq...leqamu1leqamugeqamu+1geq...geqad1geqad While the independence polynomials of many families of graphs with highly regular structure are known to be unimodal, little is known about less regularly structured graphs. We analyze the independence polynomials of a large infinite family of trees without regular structure and show that these polynomials are unimodal through a combinatorial analysis of the polynomials coefficients.











This page was built for publication: Unimodality of the independence polynomials of non-regular caterpillars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4616097)