摘要
如果图G的一个正常边染色满足任意两个不同点的关联边色集不同,且任意两种颜色所染边数目相差不超过1,则称为点可区别均匀边染色,其所用最少染色数称为点可区别均匀边色数.本文得到了星、扇和轮的倍图的点可区别均匀边色数.
A proper edge coloring of graph G is called vertex-distinguishing-equltable edge coloring if colored sets from any two vertices incident edge are different, and the number of edges in any two color classes differ by at most one, which the required minimum number of colors is called the vertex-distinguishing-equitable edge chromatic number.In this paper, we obtain the vertexdistinguishing-equitable edge chromatic numbers of double-graphs of star, fan and wheel.
出处
《经济数学》
2008年第4期437-440,F0003,共5页
Journal of Quantitative Economics
基金
国家自然科学基金资助项目(No.40301037)
国家民委科研项目(No.05XB07)
西北民族大学中青年科研基金项目(No.X2007-012)
关键词
倍图
点可区别均匀边染色
点可区别均匀边色数
Double-graph, vertex-distinguishlng-equitable edge coloring, vertex-distinguishing-equitable edge chromatic number
