图的全谐调着色数  

On the Total Harmonious Chromatic Number of a Graph

作　　者：刘世祥[1] 吕亚芹[1] 马龙友[1] 

机构地区：[1]北京建筑工程学院基础部,北京100044

出　　处：《北京建筑工程学院学报》2003年第1期85-87,共3页Journal of Beijing Institute of Civil Engineering and Architecture

摘　　要：图的全谐调着色数表示为Th(G)是相邻的点与边着不同颜色 ,且任何两个不同的边上有不同的三元颜色组的最小着色数。The total harmonious chromatic number of a graph G, denoted by T h(G),is the least number of colors which can be assigned to the vertices of G such that adjacent vertices and edges are colored differently and any two distinct edges have different three colors. The various other theorems on total harmonious chrimatic number are given in the paper.

关 键 词：图 全谐调着色数 树 圈 

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