关于路的并的点可区别V-全染色  

Vertex distinguishing V-total chromatic number of mP_n

作　　者：马宝林[1] 刘娟[1] 王军涛[1] 丁玉荣[1] 

机构地区：[1]河南科技学院,河南新乡453003

出　　处：《河南科技学院学报（自然科学版）》2012年第3期65-68,共4页Journal of Henan Institute of Science and Technology(Natural Science Edition)

摘　　要：根据简单图的点可区别V-全染色的概念及其染色方法,讨论了m个长度为n的路的顶点不交并的点可区别V-全染色,并给出全色数的结论及其证明,根据结论提出了相应的猜想,为进一步探讨其他简单图的点可区别V-全染色提供了理论证据,丰富了图的点可区别V-全染色的结果.According to the definition and the method of the vertex-distinguishing V-total coloring,the vertexdistinguishing V-total coloring of the vertex-disjoint union of m paths with lengths n is discussed,and the conclusion and proof of the vertex-distinguishing V-total chromatic number are given,finally,proposed a conjecture,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.

关 键 词：简单图 全色数 点可区别V-全染色 MPN 

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