Independence polynomials of some compound graphs

DOI10.1016/j.dam.2011.11.012zbMath1236.05157OpenAlexW2093777917MaRDI QIDQ412382

Bing Wei, Lanzhen Song, William Staton

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.012

zbMATH Keywords

identitiesindependence polynomialwell-covered graphcompound graphMerrifield-Simmons index

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Clique cover products and unimodality of independence polynomials ⋮ Unimodality of independence polynomials of the incidence product of graphs ⋮ On the independent domination polynomial of a graph ⋮ Independent vertex sets in the Zykov sum ⋮ Log-concavity of independence polynomials of some kinds of trees ⋮ On the Fibonacci numbers of the composition of graphs ⋮ Upper bounds for the independence polynomial of graphs at \(-1\) ⋮ On the independence polynomial of the corona of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The roots of the independence polynomial of a clawfree graph
• Independence polynomials of \(k\)-tree related graphs
• Clique polynomials and independent set polynomials of graphs
• On the roots of independence polynomials of almost all very well-covered graphs
• Some covering concepts in graphs

This page was built for publication: Independence polynomials of some compound graphs