西北师范大学学报（自然科学版）Issue(3)：1-8,13,9.
完全二部图K9，n的点可区别IE-全染色
Vertex-distinguishing IE-total colorings of complete bipartite graphs K9,n
摘要
Abstract
Let G be a simple graph . An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color . For each vertex x of G , let C(x) be the set of colors of vertex x and edges incident to x under f . A k-vertex-distinguishing IE-total-coloring of G is an IE-total coloring f of G(a k-VDIET coloring of G for short) using k colors ,if C(u)≠ C(v) for any two different vertices u and v of G .The minimum number of colors required for a VDIET coloring of G is denoted by χievt (G) , and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G briefly . VDIET colorings of complete bipartite graphs K9 ,n is discussed in this paper and the VDIET chromatic number of K9 ,n has been obtained .关键词
完全二部图/IE-全染色/点可区别IE-全染色/点可区别IE-全色数Key words
complete bipartite graphs/IE-total coloring/vertex-distinguishing IE-total coloring/vertex-distinguishing IE-total chromatic number分类
数理科学引用本文复制引用
陈祥恩,师瑾..完全二部图K9，n的点可区别IE-全染色[J].西北师范大学学报（自然科学版）,2014,(3):1-8,13,9.基金项目
国家自然科学基金资助项目 （）
