On the theory of the matching polynomial
On the theory of the matching polynomial
复制标题
DOI：
10.1002/jgt.3190050203
复制
发表时间：
1981-06
期刊：
影响因子：
--
通讯作者：
C. Godsil;I. Gutman
中科院分区：
文献类型：
--
作者：
C. Godsil;I. Gutman
本文研究了图G的匹配多项式α（G）的性质。我们给出了α（G）的一些递推公式，由此可以得出许多正交多项式族是适当图族的匹配多项式.本文研究了图的匹配多项式与特征多项式之间的关系。最后，我们考虑的结果，提供了信息的零点α（G）。
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).