摘要
基于完全图的全染色和邻强边染色,得到了相邻奇数阶完全图的直积图K2n-1×K2n+1'的邻点可区别全色数χat(K2n-1×K2n+1')=4n(n为正整数).
In this paper,the adjacent vertex-distinguishing total coloring number on K2n-1×K2n+1′ was obtained in view of the total coloring and the adjacent strong edge coloring of Complete graphs.It is proved that at(K2n-1×K2n+1′) is 4n.
出处
《佳木斯大学学报(自然科学版)》
CAS
2013年第3期464-466,共3页
Journal of Jiamusi University:Natural Science Edition
基金
陇东学院青年科技创新项目(XYZK1110)
陇东学院青年科技创新项目(XYZK1207)
关键词
完全图
直积图
邻点可区别全染色
邻点可区别全色数
complete graph
cartesian product of graph
adjacent vertex-distinguishing total coloring
the adjacent vertex-distinguishing total coloring number