The Matching Uniqueness of T(1,6,n)∪(∪ from i=0 to s C_(pi)) and Its Complement
Qiao You-fu · Hainan Daxue xuebao. Ziran kexue ban · 2010
In the paper,the properties of graph's matching polynomial and it's maximum real roots were used to prove that the necessary and sufficient condition of T(1,6,n)∪(∪si=0CPi) and its complement matching uniqueness is n≠6,9,17 or n=7,Pi≠7.