On the location of roots of independence polynomials
From MaRDI portal
Publication:596652
DOI10.1023/B:JACO.0000030703.39946.70zbMath1043.05087OpenAlexW2140324247MaRDI QIDQ596652
C. A. Hickman, Richard J. Nowakowski, Jason I. Brown
Publication date: 10 August 2004
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jaco.0000030703.39946.70
Related Items
Independence Equivalence Classes of Paths and Cycles ⋮ On the roots of domination polynomial of graphs ⋮ Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ On the roots of total domination polynomial of graphs ⋮ The \(k\)-fractal of a simplicial complex ⋮ Clique cover products and unimodality of independence polynomials ⋮ Analytic properties of sextet polynomials of hexagonal systems ⋮ Symmetric edge polytopes and matching generating polynomials ⋮ Graph products of the trivariate total domination polynomial and related polynomials ⋮ Unimodality of independence polynomials of the incidence product of graphs ⋮ Building graphs whose independence polynomials have only real roots ⋮ On the roots of all-terminal reliability 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 ⋮ Independence densities of hypergraphs ⋮ 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 ⋮ ON STAR POLYNOMIAL OF A VERTEX WEIGHTED CYCLE GRAPH AND ALSO OF A DIFFERENCE GRAPH ⋮ On the unimodality of independence polynomials of very well-covered graphs ⋮ Some results on the independence polynomial of unicyclic graphs ⋮ On the roots of edge cover polynomials of graphs ⋮ On the independent domination polynomial of a graph ⋮ Graphs whose certain polynomials have few distinct roots ⋮ INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE ⋮ Graphs whose independence fractals are line segments ⋮ Graphs with a minimal number of convex sets ⋮ Independent vertex sets in the Zykov sum ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ On the stability of independence polynomials ⋮ A note on purely imaginary independence roots ⋮ The independence polynomial of rooted products of graphs ⋮ Log-concavity of independence polynomials of some kinds of trees ⋮ Independence roots and independence fractals of certain graphs ⋮ Average independence polynomials ⋮ On the roots of domination polynomials ⋮ A logician's view of graph polynomials ⋮ On the Fibonacci numbers of the composition of graphs ⋮ On the roots of strongly connected reliability polynomials ⋮ On the reduced Euler characteristic of independence complexes of circulant graphs ⋮ On the roots of Wiener polynomials of graphs ⋮ On the location of roots of graph polynomials ⋮ ON THE ROOTS OF TOTAL DOMINATION POLYNOMIAL OF GRAPHS, II ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic ⋮ Independence polynomials of circulants with an application to music ⋮ Unimodality of the independence polynomials of some composite graphs ⋮ Some families of graphs with no nonzero real domination roots ⋮ Domination Polynomials of certain hexagon lattice 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
- Matching theory
- Limits of chromatic zeros of some families of maps
- Bounds on the number of complete subgraphs
- Clique polynomials and independent set polynomials of graphs
- Roots of independence polynomials of well covered graphs
- On the numbers of independent \(k\)-sets in a claw free graph
- Recursive families of graphs
- Theory of monomer-dimer systems
- Dependence polynomials
- Lower bounds on the number of triangles in a graph
- On the theory of the matching polynomial
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- Coloring graphs with fixed genus and girth
- Some covering concepts in graphs
- On chromatic roots of large subdivisions of graphs
