一类图的匹配唯一性

On the matching unigueness of a classes of graphs

本文证明了图kK1∪m2P2∪m3P3∪[∪i≥2m2iP2i]∪dD4∪tT1、2、3∪sT1、2、4匹配唯一当且仅当dm2=dm3=0.其中k、m2、m3、m2i(i≥2)、d、t、s都是非负整数.

In this paper,we prove that the graph kK_1∪m_2P_2∪m_3P_3∪∪dD_4∪tT_(123)∪sT_(124)is Matching unigue if and only if dm_2=dm_3=0,where k,m_2,m_3,m_(2i)(i≥2),d,s,t are nonnegative integers.