## 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 matching polynomial and its relation to the rook polynomial
β Scribed by E.J. Farrell
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 550 KB
- Volume
- 325
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
## Abstract In this paper, we propose a definition of determinant for quaternionic polynomial matrices inspired by the wellβknown DieudonnΓ© determinant for the constant case. This notion allows to characterize the stability of linear dynamical systems with quaternionic coefficients, yielding result
## Abstract This paper represents the third part of a contribution to the βdictionaryβ of homogeneous linear differential equations with polynomial coefficients on one hand and corresponding difference equations on the other. In the first part (cf. [4]) we studied the case that the differential equ
Let \* 1 >\* 2 > } } } >\* d be points on the real line. For every k=1, 2, ..., d, the k-alternating polynomial P k is the polynomial of degree k and norm Because of this optimality property, these polynomials may be thought of as the discrete version of the Chebychev polynomials T k and, for parti