点圈并图的匹配等价图数

The Number of Matching Equivalent for the Union Graph of Points and Cycles

若两个图G和H的匹配多项式相等,则称图G和H匹配等价.用δ(G)表示图G的所有不同构的匹配等价图的个数.计算了δ(sK_1∪t_1C_6∪t_2C_(15)).

For two graphs G and H, if G and H have the same matching polynomial, then G and H is said to be matching equivalent. We denote by δ（G） the number of the matching equivalent graphs of G. In this paper, we giveδ（sK1 ∪ t1C6 ∪ t2C15）.