On the location of roots of independence polynomials
From MaRDI portal
Publication:596652
DOI10.1023/B:JACO.0000030703.39946.70zbMath1043.05087MaRDI QIDQ596652
Richard J. Nowakowski, C. A. Hickman, Jason I. Brown
Publication date: 10 August 2004
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Independence roots and independence fractals of certain graphs, On the unimodality of independence polynomials of some graphs, Building graphs whose independence polynomials have only real roots, The roots of the independence polynomial of a clawfree graph, The independence polynomial of rooted products of graphs, Independence polynomials of circulants with an application to music, Average independence polynomials, The \(k\)-fractal of a simplicial complex, On the roots of independence polynomials of almost all very well-covered graphs, On the roots of strongly connected reliability polynomials
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