The matching uniqueness of two kind of graphs and its complement
Shen Shi-chang · Journal of Northeast Normal University · 2006
LtGbe a si mple graph.The matching polynomial be denoted byμ(G,x).Two graphGandHare said to be matching equivalent,si mply denoted byG~H,ifμ(G,x)=μ(H,x).AgraphGis match-ing unique ifG~Hi mplies thatH G.It is discussed to the matching uniqueness ofT-shape tree,T(m,m+1,m+2)andT(m,m+1,m+3)andits complement are matching unique be proved.