✦ LIBER ✦

On the Location of Roots of Independence Polynomials

✍ Scribed by J.I. Brown; C.A. Hickman; R.J. Nowakowski

Book ID: 111587722
Publisher: Springer
Year: 2004
Tongue: English
Weight: 88 KB
Volume: 19
Category: Article
ISSN: 0925-9899
DOI: 10.1023/b:jaco.0000030703.39946.70

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the location of roots of Steiner poly

On the location of roots of Steiner polynomials

✍ Martin Henk; María A. Hernández Cifre 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 185 KB

On the location of roots of non-reciproc

On the location of roots of non-reciprocal integer polynomials

✍ Artūras Dubickas 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 228 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

Note on the location of the roots of a p

Note on the location of the roots of a polynomial

✍ J. L. Walsh 📂 Article 📅 1926 🏛 Springer-Verlag 🌐 French ⚖ 559 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 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