Cartesian积图的关联色数与邻点可区别关联色数  

The incidence chromatic number and the adjacent vertex distinguishing incidence chromatic number of Cartesian product

作　　者：董桂香[1] 张丽[2] 

机构地区：[1]山东建筑大学理学院,济南250101 [2]上海金融学院统计与数学学院,上海201209

出　　处：《黑龙江大学自然科学学报》2016年第4期462-465,共4页Journal of Natural Science of Heilongjiang University

基　　金：国家自然科学基金资助项目(11471195);山东省高等学校科技计划项目(J14LI53)

摘　　要：图G的一个关联着色是指从关联集I(G)到颜色集C的一个映射,使得任意两个相邻的关联不着同色;而图G的邻点可区别关联着色是要求任何相邻顶点具有不同色集的关联着色。研究星分别与星、扇和轮的Cartesian积图的关联着色和邻点可区别关联着色,利用构造染色的方法,确定其关联色数与邻点可区别关联色数都是最大度加一。An incidence coloring of a graph G is a mapping from the incidence set I（G） to color set C such that any two neighborly incidences are assigned different colors. An adjacent vertex distinguishing incidence coloring of a graph G is an incidence coloring of the G such that no pair of adjacent vertices have the same set of colors. The incidence coloring and the adjacent vertex distinguishing incidence colo- ring of Cartesian product of star and star, fan and wheel are studied, respectively. By using the method of constructing dyeing, it is shown that their incidence chromatic numbers and the adjacent vertex distin- guishing incidence chromatic numbers are maximum degree plus one.

关 键 词：Cartesian积图 关联着色 邻点可区别关联着色 邻点可区别关联色数 

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