Bounding the roots of independence polynomials.

MaRDI QIDQ2716005zbMATH OpenFDO

Authors Jason I. Brown, R. J. Nowakowski

Publication date 20 July 2005

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

line graphindependent set

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Real polynomials: location of zeros (26C10)

Recommendations

• On the location of roots of independence polynomials
• On a conjecture of Sokal concerning roots of the independence polynomial
• On the roots of expected independence polynomials
• Note on the smallest root of the independence polynomial
• scientific article; zbMATH DE number 19603
• On the largest real root of independence polynomials of trees.
• Roots of independence polynomials of well covered graphs
• On the bounds for the roots of a polynomial
• On the stability of independence polynomials

Cited in

(23)

• Average independence polynomials
• The \(k\)-fractal of a simplicial complex
• Some families of graphs with no nonzero real domination roots
• The independence fractal of a graph.
• Building graphs whose independence polynomials have only real roots
• A note on purely imaginary independence roots
• Graphs, partitions and Fibonacci numbers
• The independence polynomial of rooted products of graphs
• Generalizations of the matching polynomial to the multivariate independence polynomial
• On the largest real root of independence polynomials of trees.
• Graphs with a minimal number of convex sets
• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
• On the dependence polynomial of a graph
• The roots of the independence polynomial of a clawfree graph
• On the roots of Wiener polynomials of graphs
• Maximum modulus of independence roots of graphs and trees
• Note on the smallest root of the independence polynomial
• Cayley trees do not determine the maximal zero-free locus of the independence polynomial
• Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture
• Reconstructing subgraph-counting graph polynomials of increasing families of graphs
• A way to construct independence equivalent graphs
• Independence polynomials of circulants with an application to music
• On the roots of independence polynomials of almost all very well-covered graphs

This page was built for publication: Bounding the roots of independence polynomials.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716005)