若干联图的邻点可区别关联染色

J4 ›› 2011, Vol. 46 ›› Issue (8): 89-91.

若干联图的邻点可区别关联染色

王倩,田双亮

西北民族大学数学与计算机科学学院，甘肃兰州 730030

收稿日期:2010-05-26 出版日期:2011-08-20 发布日期:2011-09-08
作者简介:王倩(1981- ), 女, 讲师,硕士, 主要研究方向为图论与组合优化.Email: jswq@xbmu.edu.cn
基金资助:
国家民委科研资助项目(10XB01)

Adjacent vertex distinguishing incidence coloring of the join of some special graphs

WANG Qian, TIAN Shuang-liang

Mathematics and Computer Science College of Northwest University for Nationalities, Lanzhou 730030, Gansu, China

Received:2010-05-26 Online:2011-08-20 Published:2011-09-08

摘要/Abstract

摘要：

图G的邻点可区别关联染色是指G的任意相邻顶点具有不同色集的关联染色。研究了联图G∨C_m, G∨S_m和G∨T_m的邻点可区别关联染色, 得到了相应的邻点可区别关联色数, 其中G是n+1阶的星, 轮或扇; C_m为m阶圈, S_m为m+1阶星, T_m为m阶树。

关键词: 联图;关联染色；邻点可区别关联染色; 邻点可区别关联色数

Abstract:

An adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors. The adjacent vertex distinguishing incidence chromatic number of G∨C_m, G∨S_m and G∨T_m are obtained, where G is a star, wheel, or fan of order n+1 and C_m is a cycle of order m, S_m is a star of order m+1, T_m is a tree of order m.

Key words: join of graphs; incidence coloring; adjacent vertex distinguishing incidence coloring; adjacent vertex distinguishing incidence chromatic number

王倩,田双亮. 若干联图的邻点可区别关联染色[J]. J4, 2011, 46(8): 89-91.

WANG Qian, TIAN Shuang-liang. Adjacent vertex distinguishing incidence coloring of the join of some special graphs[J]. J4, 2011, 46(8): 89-91.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed