摘要
根据图的点可区别全染色的概念及其染色方法,讨论了图的点可区别V-全染色,给出了完全图Kn的点可区别V-全色数的结论及其证明,为进一步探讨其他简单图的点可区别V-全染色提供了理论证据,丰富了图的点可区别V-全染色的结果.
According to the definition and the method of the vertex-distinguishing total coloring,the vertex-distinguishing V-total coloring of gragh is discussed,and the conclusion and proof of the vertex-distinguishing V-total chromatic number of complete graph Kn are given.To further explore other simple graph vertex-distinguishing V-total coloring provides a theoretical evidence that enriched the graph vertex-distinguishing V-total coloring results.
出处
《河南科技学院学报(自然科学版)》
2011年第5期44-46,50,共4页
Journal of Henan Institute of Science and Technology(Natural Science Edition)
关键词
简单图
点可区别V-全染色
点可区别V-全色数
完全图
simple graph
Vertex-distinguishing V-total coloring
Vertex-distinguishing V-total chromatic number
complete graph