几类乘积图的邻点可区别的边色数  

The Adjacent-Vertex Distinguishing Edge Chromatic Number of Some Classes of Cartesian Product Graphs

作　　者：刘海涛[1] 

机构地区：[1]兰州城市学院数学系,甘肃兰州730070

出　　处：《甘肃联合大学学报（自然科学版）》2008年第2期30-31,36,共3页Journal of Gansu Lianhe University :Natural Sciences

基　　金：甘肃省教育厅科研基金项目(0511-05)

摘　　要：设G是阶数不小于3的简单连通图,G的k-正常边染色称为是邻点可区别的,如果对G任意相邻两顶点关联边的颜色集合不同,则k中最小者称为是G的邻点可区别的边色数.本文给出了几类乘积图的邻点可区别的边色数的上界,并由此得到一些乘积图的邻点可区别的边色数.Let G be a simple connected graph with ordr not less than 3, k-proper edge coloring of G is called adjacent-vertex distinguishing, if for arbitrary two adjacent vertices which are incident to different sets of colored edges. The minimum number required for an adjacent-vertex distinguishing edge coloring（AVDEC） of G is called the adjacent strong edge chromatic number. In this paper, we give two upper bounds of adjacent-vertex distinguishing edge chromatic number of Cartesian product graphs, and some results are obtained.

关 键 词：乘积图 邻点可区别的边色数 上界 

分 类 号：O157.5[理学—数学]