摘要：
By unsing the properties of adjoint polynomials of graphs or even,we discuss the factorizations of adjoint polynomials of graphs Y (2, 2,λ)∪K1 (where m is odd)and Y (2, 2,λ)∪EGδ (where m is even). Let m = 2Kq −1, letλn = (2nq −1)+2n−1qδ,we discuss the factorizations of adjoint polynomials of graphs Y (2, 2,λk )∪(k−1)K1 and Y (2, 2,λk ). Further more ,we prove chromatically equivalence of complements of these graphs.%构造了两类图簇 Y (2,2,λ)∪K1(m 为奇数)和 Y (2,2,λ)∪EGδ(m 为偶数)。运用图的伴随多项式,讨论了这两类图簇的伴随多项式的因式分解式,(m=2k−1 q−1,λk=(2kq−1)+2k−1qδ),研究了图簇Y (2,2,λk)∪(k−1)K1和Y (2,2,λk)的伴随多项式的因式分解式,进而证明了这些图的补图的色等价性。
