关于C_mo C_n和C_mo P_n星全色数

Star Total Chromatic Number of C_mo C_n and C_mo P_n

对于一个图G=G(V(G),E(G)),用V(G)和E(G)表示图的顶点集合和边集合.图G的3个顶点的路边和顶点着有5种色,跑遍图G的所有k星全着色所取得的最小数k称为图G的星全色数,简记为sχt(G).主要研究了Cmo Cn和Cmo Pn2种冠图的星全染色规律,并得出它们的星全色数.

Let G=G（V（G） ,E（G））be a graph,where V（G）and E（G）denote the vertex set and edge set of G. A proper total k-coloring of a graph G is a star total k-coloring if the colorings of vertices and edges of any path of length 3 in G are all different. The least number of k spanning over all star total-colorings of G, denoted by Xst （G） is called the star total chromatic number of G. In this paper, we obtained star chromatic numbers of Cm o Cn and Cm o Pn.