The Matching Uniqueness of T(1,2,n)∪(∪ from i=o to s C_(Pi)) and Its Complement
Shen Shi-chang · Journal of Qinghai Junior Teachers' College · 2005
In this paper,we have discussed the matching uniqueness of graphs,and proved that T(1,2,n)∪(∪s(i=0) C_(Pi)) are matching unique if and only if n≠1,2,5,9 or n=3,p_i≠3,15 or n=4,{3,5} and {5,9}{p_i│i=0,1,...s}.