利用图的匹配多项式及最大实数根的性质证明了一类新图T(1,1,n,3,1)及其补图匹配唯一的充要条件是n≠1,3,6.
The matching uniqueness of a class of new graphs T(1,1,n,3,1) and its complement are proved if and only if n≠1,3,6,by the properties of graph's matching polynomial and it's maximum real roots.