摘要
完全刻画了匹配最大根M1(G)≤ 2的图和匹配次大根M2 (G) <1的图 .
In this paper, the authors completely characterize the graphs with M 1(G)≤2, and the graphs with M 2(G)<1 , where M 1(G) and M 2(G) are the first root and the second root of the matching polynomial μ(G,x) of the graph G respectively`.
出处
《曲阜师范大学学报（自然科学版）》
CAS
2001年第1期33-36,共4页
Journal of Qufu Normal University(Natural Science)
基金
青海省教委基金资助课题
关键词
匹配多项式
最大根
次大根
图
matching polynomials
first root
second root
