直积图P_m∧P_n与P_m∧C_n的第一类弱全染色  

On a Number of the First Weak Total Coloring of Direct Product Graph

作　　者：王大胄[1] 席进华[1] 

机构地区：[1]甘肃民族师范学院数学系,甘肃合作747000

出　　处：《甘肃高师学报》2017年第3期1-3,共3页Journal of Gansu Normal Colleges

摘　　要：图染色是图论的重要组成部分,它有着一定的理论意义和实际应用背景.应用构造染色函数法给出了直积图P_m∧P_n与P_m∧C_n的第一类弱全染色数,从而验证了第一类弱全染色猜想的成立.Graph coloring is an important part of graph theory, which has a certain theoretical and practical application background, In this paper, we give the first kind weak total coloring number of direct product graph Pm∧Pn and Pm∧Cn by using the constructor method, And then verify these graphs to set up the first weak total coloring conjecture.

关 键 词：直积图 第一类弱全染色 路 圈 

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