On the independence polynomials of path-like graphs

zbMATH Open1256.05109MaRDI QIDQ2906838FDOQ2906838

Patrick Bahls

Publication date: 5 September 2012

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p003.pdf

zbMATH Keywords

independence polynomialschromatic polynomialscoefficient sequencesconcave sequencespath-like graphs

Mathematics Subject Classification ID

Graph polynomials (05C31)

Cited In (16)

• The Complexity of Finding Paths in Graphs with Bounded Independence Number
• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• Unimodality of the independence polynomials of non-regular caterpillars
• Clique cover products and unimodality of independence polynomials
• Log-concavity of some independence polynomials via a partial ordering
• Log-concavity of independence polynomials of some kinds of trees
• Unimodality of independence polynomials of rooted products of graphs
• Unimodality of the independence polynomials of some composite graphs
• Atom probe tomography characterization of solute segregation to dislocations and interfaces
• On the coefficients of the independence polynomial of graphs
• Dependency Pairs and Polynomial Path Orders
• On the independence polynomial of an antiregular graph
• On the maximal independence polynomial of certain graph configurations
• On real-rootedness of independence polynomials of rooted products of graphs
• Unimodality of independence polynomials of the cycle cover product of graphs
• The independent set sequence of some families of trees

This page was built for publication: On the independence polynomials of path-like graphs

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