On the roots of independence polynomials of almost all very well-covered graphs
From MaRDI portal
Publication:2473044
DOI10.1016/j.dam.2006.06.016zbMath1137.05053arXiv1105.2202MaRDI QIDQ2473044
Vadim E. Levit, Eugen Mandrescu
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
05C05: Trees
05E99: Algebraic combinatorics
05A20: Combinatorial inequalities
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number, Building graphs whose independence polynomials have only real roots, The independence polynomial of rooted products of graphs, Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
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
