𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the distance between the roots of a polynomial

✍ Scribed by Maurice Mignotte


Publisher
Springer
Year
1995
Tongue
English
Weight
221 KB
Volume
6
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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