摘要
设G是阶数不小于3的简单连通图,G的k-正常边染色称为是邻点可区别的,如果对G任意相邻两顶点关联边的颜色集合不同,则k中最小者称为是G的邻点可区别的边色数.证明了C2m×Cn的邻点可区别的边色数是5.
Let G be a simple connected graph with order not less than 3. k-proper edge coloring of G is called adjacent-vertex distinguishing. If two arbitrarily adjacent vertics are incident to different sets of colored edges, the minimal number required for an adjacent-vertex distinguishing edge coloring（AVDEC） of G is called the adjacent strong edge chromatic number. The adjacent strong edge chromatic number of C2m × Cn
is proved to be 5.
出处
《甘肃科学学报》
2007年第2期35-37,共3页
Journal of Gansu Sciences
基金
甘肃省教育厅科研基金项目(0511-05)
关键词
图
边染色
邻点可区别的边染色
graph
edge coloring
adjacent-vertex-distinguishing edge coloring
