一些特殊图的最大匹配的强迫数

The maximum matching forcing number in some special graphs

设M是图G的一个最大匹配,S是M的一个子集.如果S除了被M包含而不被图G的其他最大匹配所包含,那么称S是M的一个强迫集.M的最小强迫集所包含的边数称作M的强迫数,记为fM(G,M).图G的所有最大匹配的强迫数的最小值称为图G的最小强迫数,记作fM(G).本文给出了一些特殊图类的最大匹配的强迫数的确切值.

Let M be a maximum matching of graph G.A subset S■M is called a forcing set of Mif Sis only contained in maximum matching M of G.The cardinality of minimum forcing set of M is called the forcing number of M,denoted by fM(G,M).The minimum of forcing number of all maximum matchings in Gis called the minimum forcing number of G,denoted by fM(G).In this paper,we obtain the exactly formulae of forcing numbers of maximum matchings in some special graphs.