【摘要】 设n 4,Dn表示Pn-2的一个1度点中K3的一个顶点粘拉得到的图。利用伴随多项式及其最小负实数根的性质简化证明了_n色唯一的充要条件是n≠4,8。更多还原

【Abstract】 In this paper,we prove that for n≥4,Dn is thromatically uniqueness,if and only if n≠4 and 8,by the property of graph’s adjoint polynomial and it’s minimum root,where Pn-2 is a path with vertex sequence ν1,ν2,...,νn-2.Dn is the graph obtained from Pn-2 and K3 by identifying vertex ν1 of Pn-2 with a vertex of K3.更多还原