一类字典积CnH的星全染色

摘要

简单图G和H的字典积G[H]是指具有顶点集V(G)×V(H)的简单图G[H],其顶点(u,v)和另一个顶点(u',v')相邻当且仅当uu'∈E(G),或者u=u'且vv'∈E(H).研究了n阶圈Cn与m阶简单图H的字典积Cn[H]的星全染色,得到了圈与某些特殊图的字典积的星全色数.%The lexicographic product, of simple graphs G and H is the simple graph G[H] with vertex set V( G) X V(H) in which ( u, v) is adjacent to (u', v') if and only if either uu' ∈ E( G) or u = u' and w ∈ E(H). The paper focuses on the star total coloring of the lexicographic product of a cycle Cn with n vertices and a simple graph H with m vertices. And the star total chromatic numbers of lexicographic product cycle Cn with some graphs are obtained.