Note on the smallest root of the independence polynomial

DOI10.1017/S0963548312000302MaRDI QIDQ4903259zbMATH OpenFDO

Authors Péter Csikvári

Publication date 21 January 2013

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548312000302

zbMATH Keywords

clique polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Bounding the roots of independence polynomials.
• On the rational independence roots
• On the location of roots of independence polynomials
• On the largest real root of independence polynomials of trees.
• Maximum modulus of independence roots of graphs and trees

Cites work

• Analytic combinatorics
• Bounds on the largest root of the matching polynomial
• Clique polynomials have a unique root of smallest modulus
• Combinatorial problems of commutation and rearrangements
• Dependence polynomials
• Lower bounds on the number of triangles in a graph
• On Dependency Graphs and the Lattice Gas
• The number of cliques in graphs of given order and size
• The Number of Words of Length n in a Graph Monoid
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma

Cited in

(20)

• Toward uniform random generation in 1-safe Petri nets
• A cut-invariant law of large numbers for random heaps
• On the stability of independence polynomials
• A note on purely imaginary independence roots
• Independence polynomials of bipartite graphs
• Maximum modulus of independence roots of graphs and trees
• Markovian dynamics of concurrent systems
• Graphs whose independence fractals are line segments
• Generalizations of the matching polynomial to the multivariate independence polynomial
• One more remark on the adjoint polynomial
• Bounding the roots of independence polynomials.
• On the growth of deviations
• Uniform generation in trace monoids
• The clique density theorem
• Two remarks on the adjoint polynomial
• On the largest real root of independence polynomials of trees.
• The exact minimum number of triangles in graphs with given order and size
• Entropy and the clique polynomial
• Bounds on the maximum modulus of dissociation roots
• Independence polynomials of graphs with given cover number or dominate number

This page was built for publication: Note on the smallest root of the independence polynomial

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