关于多重联图的均匀全染色

On the Equitable Total Coloring of Multiple Join-Graph

中文关键词:  联图  均匀全染色  均匀全色数.

英文关键词:join-graph  equitable total coloring  equitable total chromatic number.

中文摘要:

      对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过１时, 称为均匀全染色, 其所用最少染色数称为均匀全色数. 本文证明了关于多重联图的若干情况下的均匀全色数定理, 得到了若干特殊多重联图的均匀全色数.

英文摘要:

      A total-coloring is called equitable if $| \mid S_{i}\mid-\mid S_{j}\mid |\leq 1$, where $\mid S_{i}\mid$ is the chromatic number of the color. The minimum number of colors required for an equitable proper total-coloring. A simple graph $G$ is denoted by $\chi_{et}(G)$. In this paper, we prove theorems of equitable total coloring of multiple join-graph and get equitable total chromatic numbers of some special multiple join-graph.