The independence polynomial of rooted products of graphs

DOI10.1016/j.dam.2009.10.009zbMath1201.05048OpenAlexW1969007797MaRDI QIDQ968175

Vladimir R. Rosenfeld

Publication date: 5 May 2010

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

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

zbMATH Keywords

independence polynomialreal independence-polynomial rootsrooted product of graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (10)

Clique cover products and unimodality of independence polynomials ⋮ Unimodality of independence polynomials of the incidence product of graphs ⋮ Unnamed Item ⋮ Certificates for properties of stability polynomials of graphs ⋮ Independent vertex sets in the Zykov sum ⋮ Log-concavity of independence polynomials of some kinds of trees ⋮ The independent set sequence of some families of trees ⋮ Upper bounds for the independence polynomial of graphs at \(-1\) ⋮ Unimodality of the independence polynomials of some composite graphs ⋮ The \(k\)-path vertex cover of rooted product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On F-polynomials of thistles
• On the location of roots of independence polynomials
• Algorithmic uses of the Feferman-Vaught theorem
• The roots of the independence polynomial of a clawfree graph
• Products of graceful trees
• An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers
• Recent results in the theory of graph spectra
• Clique polynomials and independent set polynomials of graphs
• Roots of independence polynomials of well covered graphs
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• Average independence polynomials
• On the roots of independence polynomials of almost all very well-covered graphs
• The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• On Dependency Graphs and the Lattice Gas
• A new graph product and its spectrum

This page was built for publication: The independence polynomial of rooted products of graphs