Vertex distinguishing equitable total chromatic number of join graph

被引：17

作者：

Wang, Zhi-wen ^{[1
,2
]}

Yan, Li-hong ^{[2
]}

Zhang, Zhong-fu ^{[3
]}

机构：

[1] Yeungnam Univ, Dept Math, Kyongsan 712749, Kyongbuk, South Korea

[2] Xianyang Normal Univ, Dept Math, Xianyang 712000, Peoples R China

[3] Lanzhou Jiaotong Univ, Sch Math, Lanzhou 730070, Peoples R China

来源：

ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES | 2007年 / 23卷 / 03期

关键词：

path; cycle; join graph; vertex distinguishing equitable total chromatic number;

D O I：

10.1007/s10255-007-0383-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A vertex distinguishing equitable total coloring of graph G is a proper total coloring of graph G such that any two distinct vertices' coloring sets are not identical and the difference of the elements colored by any two colors is not more than 1. In this paper we shall give vertex distinguishing equitable total chromatic number of join graphs P-n V P-n, C-n V C-n and prove that they satisfy conjecture 3, namely, the chromatic numbers of vertex distinguishing total and vertex distinguishing equitable total are the same for join graphs P-n V P-n and C-n V C-n.

引用

页码：433 / 438

页数：6