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 Orthogonal Polynomials and Euler-Frobenius Polynomials
β Scribed by F. Dubeau; J. Savoie
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 433 KB
- Volume
- 196
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper deals with Hermite Pade polynomials in the case where the multiple orthogonality condition is related to semiclassical functionals. The polynomials, introduced in such a way, are a generalization of classical orthogonal polynomials (Jacobi, Laguerre, Hermite, and Bessel polynomials). They
Starting from the Delsarte Genin (DG) mapping of the symmetric orthogonal polynomials on an interval (OPI) we construct a one-parameter family of polynomials orthogonal on the unit circle (OPC). The value of the parameter defines the arc on the circle where the weight function vanishes. Some explici