图C_m ∨ C_n的Smarandachely邻点可区别全色数

Smarandachely Adjacent Vertex Distinguishing Total Coloring of Graph C_m ∨ C_n

图的一个正常全染色满足相邻点的色集合互不包含时被称为Smarandachely邻点可区别全染色.使图G存在使用了k种色的Smarandachely邻点可区别全染色的最小数k称为图G的Smarandachely邻点可区别全色数,其中任意一点的色集合为该点所染色与其关联边所染色的并.文章给出了当(m<n)且m为偶数时,m阶圈与n阶圈的联图的Smarandachely邻点可区别全色数.

A proper total coloring of graphs,which satisfies the exclusion of each other among adjacent color＇s sets,is called Smarandachely adjacent vertex distinguishing total coloring.The minimal number k,which is used in Smarandachely adjacent vertex distinguishing total coloring for the existence of G,is called Smarandachely adjacent vertex distinguishing total chromatic number of graph G.Among them,any color＇s set is a union of colors to be assigned to the vertex and the incident edges.In this paper.Smarandachely adjacent vertex clistinguishing total chromatic number of graph Cm ∨ Cn（mn and m≡0（mod2）） is studied.