摘要
研究不可约图的补图的色唯一性问题是图论的一个重要内容,该文在论证过程中利用图G的伴随多项式的末项的特点,通过比较伴随多项式的末项,探讨了一类n个点n+1条边且R(G)=-2的不可约图的补图的色唯一性的问题,并推广了文[8]中的结论。在本文中,我们得到如下结论:设|V(B1)|=n(>8),若B1是不可约,则B1是色唯一的。
Researching chromatic uniqueness of a graph is an important part of graph theory. In this paper ,we make use of the last coefficient of adjoint polynomial of graph G and compare the last coefficient of adjoint polynomial ,to find out a class graphs which are irreducible, G=(p,p+1) and R(G)=-2 and the complements of these graphs are chromatically unique .Then we have improved the theorem in literature [6].We can draw a conclusion : Let |V(B1)|=n(>8),if B1 is irreducible,then (B1) is chromatically unique .
出处
《茂名学院学报》
2004年第4期57-61,共5页
Journal of Maoming College
关键词
色多项式
伴随多项式
色唯一图
chromatic polynomial
adjoint polynomial
chromatically unique graph
