Roots of independence polynomials of well covered graphs
From MaRDI portal
Publication:1577528
DOI10.1023/A:1008705614290zbMath0994.05109OpenAlexW1509680213MaRDI QIDQ1577528
Karl Dilcher, Richard J. Nowakowski, Jason I. Brown
Publication date: 10 October 2002
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008705614290
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Independence Equivalence Classes of Paths and Cycles ⋮ The \(k\)-fractal of a simplicial complex ⋮ Clique cover products and unimodality of independence polynomials ⋮ Distinctive power of the alliance polynomial for regular graphs ⋮ Building graphs whose independence polynomials have only real roots ⋮ Total coloring of certain classes of product graphs ⋮ On the location of roots of independence polynomials ⋮ On the Roots of Expected Independence Polynomials ⋮ The roots of the independence polynomial of a clawfree graph ⋮ Maximum modulus of independence roots of graphs and trees ⋮ On the unimodality of independence polynomials of some graphs ⋮ Independent set and matching permutations ⋮ On real-rootedness of independence polynomials of rooted products of graphs ⋮ Co-2-plex polynomials ⋮ Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs ⋮ Well-covered circulant graphs ⋮ The roller-coaster conjecture revisited ⋮ The independence fractal of a graph. ⋮ On the unimodality of independence polynomials of very well-covered graphs ⋮ Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ A way to construct independence equivalent graphs ⋮ Graphs whose certain polynomials have few distinct roots ⋮ On the differential polynomial of a graph ⋮ Maximal-clique partitions and the roller coaster conjecture ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ On the stability of independence polynomials ⋮ Alliance polynomial of regular graphs ⋮ A simple proof of an inequality connecting the alternating number of independent sets and the decycling number ⋮ A note on purely imaginary independence roots ⋮ The independence polynomial of rooted products of graphs ⋮ The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma ⋮ Average independence polynomials ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ On the roots of strongly connected reliability polynomials ⋮ Independence polynomials of circulants with an application to music ⋮ Unnamed Item ⋮ Unimodality of the independence polynomials of some composite graphs ⋮ Domination Polynomials of certain hexagon lattice graphs ⋮ On the independence polynomial of the corona of 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
- On the unimodality of the independent set numbers of a class of matroids
- On the Eneström-Kakeya theorem and its sharpness
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- Bounds on the number of complete subgraphs
- Clique polynomials and independent set polynomials of graphs
- On the log concavity of reliability and matroidal sequences
- On the numbers of independent \(k\)-sets in a claw free graph
- Polynomial invariants of graphs. II
- Dependence polynomials
- Lower bounds on the number of triangles in a graph
- On the theory of the matching polynomial
- On Unimodality for Linear Extensions of Partial Orders
- Roots of the Reliability Polynomials
- WELL-COVERED GRAPHS: A SURVEY
- A Generalization of a Theorem of Bôcher
- Some covering concepts in graphs
- Polynomials
