摘要
讨论了路、圈、星的Mycielski图的点可区别均匀全染色问题,得到了其点可区别均匀全色数.
Make use of relevant conclusions of equitable total coloring, the vertex distinguish- ing equitable total chromatic numbers of Mycielski-graph of Path,cycle and star were discussed ,and the vertex distinguishing equitable total chromatic number of them'were obtained.
出处
《数学的实践与认识》
CSCD
北大核心
2013年第18期135-140,共6页
Mathematics in Practice and Theory
关键词
图
MYCIELSKI图
点可区别均匀全染色
点可区别均匀全色数
graph
Mycielski-graphs
vertex distinguishing equitable total coloring
vertexdistinguishing equitable total chromatic number