若干补倍图的点可区别全染色

J4 ›› 2011, Vol. 46 ›› Issue (2): 45-50.

若干补倍图的点可区别全染色

文飞¹,王治文², 王鸿杰³, 包世堂⁴, 李沐春¹*,张忠辅¹

1.兰州交通大学应用数学研究所, 甘肃兰州 730070；
2.宁夏大学数学与计算机学院, 宁夏银川 750021；
3.兰州交通大学铁道技术学院, 甘肃兰州 730070；
4.兰州城市学院信息工程学院, 甘肃兰州 730070

收稿日期:2010-03-24 出版日期:2011-02-16 发布日期:2011-03-30
通讯作者: 李沐春(1965- ),女，教授,研究方向为图论. Email: limuchun1983@sina.com
作者简介:文飞(1984- ),男,硕士,研究方向为图论与组合优化. Email: wenfei1998@126.com
基金资助:
国家自然科学基金资助项目 (10771091;11061017);宁夏大学科学研究基金资助项目((E)ndzr10-7);甘肃省自然科学基金资助项目(1010RJZA075)

Vertex-distinguishing total coloring of some complement double graphs

WEN Fei1, WANG Zhi-wen2, WANG Hong-jie3, BAO Shi-tang4, LI Mu-chun1*, ZHANG Zhong-fu1

1. Insitute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China;
2. The Department of Mathematical and Computer, Ningxia University, Yinchuan 750021, Gansu, China;
3. Railway Technical of Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China;
4. The Information Engineering Institute, Lanzhou City University, Lanzhou 730070, Gansu, China

Received:2010-03-24 Online:2011-02-16 Published:2011-03-30

摘要/Abstract

摘要：

一个图的正常全染色被称为点可区别的即对任意两个不同点所染色颜色与该点相关联元素所染颜色构成的色集合不同。其中所用的最少颜色数称为点可区别全色数。给出了若干补倍图的点可区别全色数。

关键词: 点可区别全染色; 点可区别全色数; 补倍图

Abstract:

A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors assigned to the elements incident to u differs from the set of colors incident to v. The minimal number of colors required for a vertex distinguishing total coloring of G is called the vertex distinguishing total coloring chromatic number. The vertex distinguishing total chromatic number of some complement double graphs is obtained.

Key words: vertex distinguishing total coloring; vertex distinguishing total chromatic number; complement double graph

文飞1,王治文2, 王鸿杰3, 包世堂4, 李沐春1*,张忠辅1. 若干补倍图的点可区别全染色[J]. J4, 2011, 46(2): 45-50.

WEN Fei1, WANG Zhi-wen2, WANG Hong-jie3, BAO Shi-tang4, LI Mu-chun1*, ZHANG Zhong-fu1. Vertex-distinguishing total coloring of some complement double graphs[J]. J4, 2011, 46(2): 45-50.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed