摘要
文章设P(G,λ)是图G的色多项式,若对于任意与图G的色多项式相等(P(G,λ)=P(H,λ))的图H都与图G同构(G≌H),则称图G是色唯一图;通过比较3部图的4色类的划分数证明,如果4≤v+2≤k≤2v,n>(k-1)2/4,则完全3部图K(n,n+v,n+k)是色唯一图。
Let P(G,λ) is the chromatic polynomial of a graph G,and the graph G is chromatically unique if for any graph H,P(H,λ)=P(G,λ) implies H≌G.In this paper,by comparing the numbers of partitions into 4-color classes of the tripartite graphs,it is proved that K(n,n+v,n+k) is chromatically unique for 4≤v+2≤k≤2v and n(k-1)2/4.
出处
《合肥工业大学学报(自然科学版)》
CAS
CSCD
北大核心
2013年第3期378-380,共3页
Journal of Hefei University of Technology:Natural Science
基金
淮南职业技术学院科研资助项目(HKJ10-6)
关键词
色唯一图
色划分数
完全3部图
色等价
chromatically unique graph
number of partition into color class
complete tripartite graph
chromatic equivalence