𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the roots of strongly connected reliability polynomials

✍ Scribed by J. I. Brown; K. Dilcher

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
199 KB
Volume
54
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Roots of Chromatic Polynomials
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

On the greedoid polynomial for rooted gr
On the greedoid polynomial for rooted graphs and rooted digraphs
✍ Elizabeth W. McMahon πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 499 KB

## Abstract We examine some properties of the 2‐variable greedoid polynomial __f__(__GΒ·,t,z__) when __G__ is the branching greedoid associated to a rooted graph or a rooted directed graph. For rooted digraphs, we show a factoring property of __f__(__GΒ·,t,z__) determines whether or not the rooted di

Bounds for the Roots of Lacunary Polynom
Bounds for the Roots of Lacunary Polynomials
✍ Maurice Mignotte πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 200 KB

We give bounds for the roots of such polynomials with complex coefficients. These bounds are much smaller than for general polynomials.