树的Mycielski图的邻点可区别全色染色

数学季刊 ›› 2008, Vol. 23 ›› Issue (4): 621-624.

树的Mycielski图的邻点可区别全色染色

1. College of Information Science and Engineering,Shandong University of Science and Technology,Qingdao 266510,China2. Department of Mathematics,Tongji University,Shanghai 200092,China

收稿日期:2005-09-26 出版日期:2008-12-30 发布日期:2023-09-19
作者简介:GU Yu-ying(1980-), female, native of Taian, Shandong, engages in graph theory and complex network.
基金资助:
Supported by Natural Science Foundation of China(60503002)；

Adjacent Vertex Distinguishing Total Coloring of M(Tn)

1. College of Information Science and Engineering,Shandong University of Science and Technology,Qingdao 266510,China2. Department of Mathematics,Tongji University,Shanghai 200092,China

Received:2005-09-26 Online:2008-12-30 Published:2023-09-19
About author:GU Yu-ying(1980-), female, native of Taian, Shandong, engages in graph theory and complex network.
Supported by:
Supported by Natural Science Foundation of China(60503002)；

摘要/Abstract

摘要： A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets.According to the property of trees,the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction.

关键词: total coloring, adjacent vertex distinguishing total coloring, Mycielski graph

Abstract: A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets.According to the property of trees,the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction.

Key words: total coloring, adjacent vertex distinguishing total coloring, Mycielski graph

中图分类号:

O157.5

谷玉盈, 王淑栋. 树的Mycielski图的邻点可区别全色染色[J]. 数学季刊, 2008, 23(4): 621-624.

GU Yu-ying, WANG Shu-dong. Adjacent Vertex Distinguishing Total Coloring of M(Tn)[J]. Chinese Quarterly Journal of Mathematics, 2008, 23(4): 621-624.

[1]	郭靖, 陈祥恩. 外平面图的邻点可区别Ⅰ-全染色[J]. 数学季刊, 2017, 32(4): 382-394.
[2]	师瑾, 陈祥恩. 完全二部图K_8,n的点可区别IE-全染色[J]. 数学季刊, 2016, 31(2): 147-154.
[3]	陈祥恩, 马彦荣. 图2Cn的点可区别全染色[J]. 数学季刊, 2013, 28(3): 323-330.
[4]	王继顺. 联图C_mVG_n的邻点可区别Ｅ-全染色[J]. 数学季刊, 2012, 27(3): 328-336.
[5]	辛小青, 陈祥恩, 王志文. 圈和完全图的点可区别VE-全染色[J]. 数学季刊, 2012, 27(1): 92-97.
[6]	李光荣, 张利民. K_m,n和C_n的联图的全色数[J]. 数学季刊, 2006, 21(2): 264-270.