摘要
给出了十六个匹配等价桥,证明了两个匹配最大根小于等于2的图匹配等价当且仅当它们之间可以由这十六个匹配等价桥进行等价转换,完整地刻画了这些图的补图的匹配等价图类,找到了这些图和它们的补图中的所有匹配唯一图．
The 16 matching equivalence relations （called the matching equivalence bridges） are obtained. For two graphs, with maximum matching root less than or equal to 2, they are matching equivalent if and only if they can be equivalently transformed by the 16 matching equivalence bridges. Meanwhile, the matching equivalence classes of their complementary graphs are characterized. All matching unique graphs are obtained for a graph in which the maximum matching root less than or equal to 2 or its complement graphs.
出处
《数学学报（中文版）》
SCIE
CSCD
北大核心
2006年第6期1355-1360,共6页
Acta Mathematica Sinica：Chinese Series
基金
教育部科学技术研究重点项目资助(206156)
关键词
匹配多项式
最大根
匹配等价
matching polynomial
maximum root
matching equivalent
