摘要
设G是阶数不小于2的简单连通图,G的k 正常全染色f称为是邻点可区别的,如果对G的任意相邻的两顶 点,其点的颜色及关联边的颜色构成的集合不同.这样的k中最小者称为是G的邻点可区别全色数.得到了两条路的 联图的邻点可区别全色数.
Let G be a simple connected graph.A k-proper total coloring of G is called adjacent-distinguishing if for arbitrary two adjacent vertices u and v,C(u)≠C(v),where C(u) is the set of the colors of u and edges which is adjacent to u.The minimum k such that G has a k-adjacent-vertex-distinguishing total coloring is called the adjacent vertex distinguishing total chromatic number.The adjacent vertex distinguishing total chromatic number is obtained for the graph formed by two paths.
出处
《西北师范大学学报（自然科学版）》
CAS
2005年第1期13-15,共3页
Journal of Northwest Normal University(Natural Science)
基金
西北师范大学青年教师基金资助项目
关键词
图
全染色
邻点可区别全染色
graph
total coloring
adjacent vertex distinguishing total coloring
