摘要
本文刻画了Pm,Cn,Q(3,n),Q(s,t)的路树的匹配多项式,并得到了有关Pm,Cn,Q(3,n),Q(s,t),Ti,j,k,Ti,j,k,l,m的匹配多项式之间的一些关系,这些关系在比较这些图的最大匹配根,寻找此类图以及它们的并的匹配等价图类有重要意义.
In this paper,I characterize the matching polynomial of the graphs P m,Cn,Q(3,n), Q(s,t), T(i,j,k),T(i,j,k,l,m) and get some relations between these polynomials, these relations helps to find the roots of these polynomials, at the same time ,helps to find the matching unique graph and matching equivalent graphs of certain graphs.
出处
《青海师专学报》
2003年第6期9-11,共3页
Journal of Qinghai Junior Teachers' College
关键词
匹配多项式
匹配等价
最大根
图
Matching polynomial
matching equhalent
the largest zero