摘要
在正常全染色的定义下,使得任两相邻顶点的色集不同,这就是邻点可区别全染色.顶点v的色集是v的颜色其与及v关联的所有边的颜色.我们给出了几类有趣图的邻点可区别全色数.
Under the definition of proper total coloring of a graph, an adjacent vertex-distinguishing total coloring means that none of the two adjacent vertices is incident with the same set of colores. The coloring set of vertex v is the colors assigned to v and the edges incident to v. The adjacent vertex-distinguishing total chromatic number about some classes of funny graphs are provided.
出处
《山东科学》
CAS
2006年第2期9-11,共3页
Shandong Science
基金
国家自然科学基金(10471078)
关键词
简单连通图
邻点可区别全染色
邻点可区别全色数
simple, connected graph
the adjacent vertex-distinguishing total coloring
the adjacent vertex-distinguishing total chromatic number
