๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounds on the largest root of the matching polynomial

โœ Scribed by David C. Fisher; Jennifer Ryan


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
197 KB
Volume
110
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Bounds for the Roots of Lacunary Polynom
โœ 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.

On the theory of the matching polynomial
โœ C. D. Godsil; I. Gutman ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 325 KB ๐Ÿ‘ 1 views

## Abstract In this paper we report on the properties of the matching polynomial ฮฑ(__G__) of a graph __G__. We present a number of recursion formulas for ฮฑ(__G__), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We con

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 roots of cauchy polynomials
โœ K.P. Hadeler; G. Meinardus ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 734 KB
On the matching polynomial and its relat
โœ E.J. Farrell ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 550 KB

It is well known that the matching polynomial is related to the rook polynomial. Mention has been made of this in several articles (e.g. E.