【摘要】 研究图的色唯一性问题是图论的一个重要内容。利用图G的伴随多项式的末项的特点,探讨了一类n个点n+1条边且R（G）=-2的不可约图补图的色唯一性的问题,证明了:设|V（B₂）|=n（≥7）,若B₂是不可约的且n≠8.则■是色唯一的.更多还原

【Abstract】 Researching chromatic uniqueness of a graph is an important part of graph theory.By utilizing the characteristics of the last term of adjoint polynomial of graph G,to discuss the chromatic uniqueness of the complement of a class of graph which is irreducible,where G=（n,n+1）and R（G）=-2.One can Prove:Let |V（B₂）|=n（≥7）,if B₂ is irreducible and n≠8,then■is chromatically unique.更多还原