本文推广已有图Dn。Fn到两类新图Dn^i:Fn^i(i≥4),并运用与色和有关的代数函数一伴随函数得到它们的伴随多项式并讨论了当i=4时的不可约性.
In this paper, we generalize graphs D., F. to two new kinds of graphs i i Dn^i, Fn^i, for i≥4, and obtain their adjoint polynomials by using algebraic function termed the adjoint function corresponding to chromatic sum. Futhermore, we discuss their irreducibilities in the case of i = 4.