𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the theory of the matching polynomial

✍ Scribed by C. D. Godsil; I. Gutman

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
325 KB
Volume
5
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 consider the relation between the matching and characteristic polynomials of a graph. Finally, we consider results which provide information on the zeros of Ξ±(G).

πŸ“œ SIMILAR VOLUMES

Graph Ramsey Theory and the Polynomial H
Graph Ramsey Theory and the Polynomial Hierarchy
✍ Marcus Schaefer πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 402 KB

In the Ramsey theory of graphs F Γ„ (G, H) means that for every way of coloring the edges of F red and blue F will contain either a red G or a blue H. Arrowing, the problem of deciding whether F Γ„ (G, H), lies in 6 p 2 =coNP NP and it was shown to be coNP-hard by Burr [Bur90]. We prove that Arrowing

On the Zeroes of a Polynomial
On the Zeroes of a Polynomial
✍ H. Alzer πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 70 KB
Some Discrepancy Theorems in the Theory
Some Discrepancy Theorems in the Theory of Weighted Polynomial Approximation
✍ H.-P Blatt; H.N Mhaskar πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 208 KB

We obtain discrepancy theorems for the distribution of the zeros of extremal polynomials arising in the theory of weighted polynomial approximation on the whole real axis.