Building graphs whose independence polynomials have only real roots

DOI10.1007/s00373-009-0857-5zbMath1215.05088OpenAlexW2087689204MaRDI QIDQ844224

Eugen Mandrescu

Publication date: 18 January 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-009-0857-5

zbMATH Keywords

stable setreal rootsindependence polynomialwell-covered graph

Mathematics Subject Classification ID

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

Related Items (10)

Clique cover products and unimodality of independence polynomials ⋮ Unimodality of independence polynomials of the incidence product of graphs ⋮ On the unimodality of independence polynomials of some graphs ⋮ Unimodality of independence polynomials of the cycle cover product of graphs ⋮ On real-rootedness of independence polynomials of rooted products of graphs ⋮ The roller-coaster conjecture revisited ⋮ 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 ⋮ On the independence polynomial of the corona of graphs

Cites Work

• Clique polynomials have a unique root of smallest modulus
• On the location of roots of independence polynomials
• The roots of the independence polynomial of a clawfree graph
• A characterization of well covered graphs of girth 5 or greater
• 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.
• On the numbers of independent \(k\)-sets in a claw free graph
• Very well covered graphs
• Operations on well-covered graphs and the Roller-Coaster conjecture
• On the roots of independence polynomials of almost all very well-covered graphs
• Theory of monomer-dimer systems
• WELL-COVERED GRAPHS: A SURVEY
• Some covering concepts in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Building graphs whose independence polynomials have only real roots