螺旋六角para-链的最大匹配的强迫数

The Forcing Number of Maximum Matching in Spiro Hexagonal Para-Chain

令M是图G的一个最大匹配,S是M的一个子集。如果S除了被M包含而不被G的其它最大匹配所包含,那么称S是M的一个强迫集(forcing set)。M的最小强迫集所包含的边数称作是M的强迫数(forcing number),记为fm(G, M)。图G的所有最大匹配的强迫数的最小值称为G的最小强迫数(Minimum forcing number),记作fm(G)。在本文中,我们给出了螺旋六角para-链的最大匹配的强迫数的确切值。

Let G be a graph with a maximum matching M. A subset S ? M is called a forcing set of M if S is con-tained in only one maximum matching M of G. A forcing set of M with minimum cardinality is the minimum forcing set of M and its cardinality is called the forcing number of M, denoted by fm(G, M). The minimum forcing number of all maximum matchings in G is called the forcing number of G, denoted by fm(G). In this paper, we obtain the forcing number of maximum matching in spiro hex-agonal para-chain.