Note on the Smallest Root of the Independence Polynomial
From MaRDI portal
Publication:4903259
DOI10.1017/S0963548312000302zbMath1257.05066MaRDI QIDQ4903259
Publication date: 21 January 2013
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (15)
The clique density theorem ⋮ One more remark on the adjoint polynomial ⋮ Maximum modulus of independence roots of graphs and trees ⋮ Markovian dynamics of concurrent systems ⋮ Uniform Generation in Trace Monoids ⋮ Toward uniform random generation in 1-safe Petri nets ⋮ A cut-invariant law of large numbers for random heaps ⋮ Two remarks on the adjoint polynomial ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Graphs whose independence fractals are line segments ⋮ On the stability of independence polynomials ⋮ A note on purely imaginary independence roots ⋮ Entropy and the clique polynomial ⋮ On the growth of deviations ⋮ Independence polynomials of bipartite graphs
Cites Work
- Unnamed Item
- Clique polynomials have a unique root of smallest modulus
- Bounds on the largest root of the matching polynomial
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Combinatorial problems of commutation and rearrangements
- Dependence polynomials
- The number of cliques in graphs of given order and size
- On Dependency Graphs and the Lattice Gas
- Lower bounds on the number of triangles in a graph
- The Number of Words of Length n in a Graph Monoid
This page was built for publication: Note on the Smallest Root of the Independence Polynomial
