On the roots of independence polynomials of almost all very well-covered graphs

DOI10.1016/j.dam.2006.06.016zbMath1137.05053arXiv1105.2202OpenAlexW2102546781MaRDI QIDQ2473044

Eugen Mandrescu, Vadim E. Levit

Publication date: 26 February 2008

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

Full work available at URL: https://arxiv.org/abs/1105.2202

zbMATH Keywords

stable setrootindependence polynomialwell-covered graphclique-unique graph

Mathematics Subject Classification ID

Trees (05C05) Algebraic combinatorics (05E99) Combinatorial inequalities (05A20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Independence Equivalence Classes of Paths and Cycles ⋮ Clique cover products and unimodality of independence polynomials ⋮ Building graphs whose independence polynomials have only real roots ⋮ Maximum modulus of independence roots of graphs and trees ⋮ On real-rootedness of independence polynomials of rooted products of graphs ⋮ Co-2-plex polynomials ⋮ Independence polynomials of some compound graphs ⋮ The roller-coaster conjecture revisited ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ Independent vertex sets in the Zykov sum ⋮ On the stability of independence polynomials ⋮ A simple proof of an inequality connecting the alternating number of independent sets and the decycling number ⋮ The independence polynomial of rooted products of graphs ⋮ Log-concavity of independence polynomials of some kinds of trees ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ Unimodality of independence polynomials of rooted products of graphs ⋮ Unimodality of the independence polynomials of some composite 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
• On the ideal theory of graphs
• The independence fractal of a graph.
• Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture
• Recursively constructible families of graphs
• Roots of independence polynomials of well covered graphs
• On the numbers of independent \(k\)-sets in a claw free graph
• Very well covered graphs
• Codichromatic graphs
• Theory of monomer-dimer systems
• Dependence polynomials
• Some Finite Inversion Formulae
• On the theory of the matching polynomial
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item