✦ LIBER ✦

On the Roots of Expected Independence Polynomials

✍ Scribed by Jason I. Brown; Karl Dilcher; Dante V. Manna

Book ID: 112121139
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 502 KB
Volume: 73
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21678

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Location of Roots of Independence

On the Location of Roots of Independence Polynomials

✍ J.I. Brown; C.A. Hickman; R.J. Nowakowski 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 88 KB

Expected density of complex roots of ran

Expected density of complex roots of random polynomials

✍ K. Farahmand; A. Grigorash 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Roots of Independence Polynomials of Wel

Roots of Independence Polynomials of Well Covered Graphs

✍ J.I. Brown; K. Dilcher; R.J. Nowakowski 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 73 KB

On the roots of independence polynomials

On the roots of independence polynomials of almost all very well-covered graphs

✍ Vadim E. Levit; Eugen Mandrescu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 253 KB

On the roots of cauchy polynomials

✍ K.P. Hadeler; G. Meinardus 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 734 KB

On the Roots of Chromatic Polynomials

✍ Jason I. Brown 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 158 KB

It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)Â(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a