摘要:
设G是具有顶点集{t0,t1,…,tn-1}的轮,或扇,或星,其中t0为最大度点,且n≥5.G[hn]是图G与顶点不相交图序列hn=(Hi)i∈{0,1,…,n-1}的广义字典积,其中每一个Hi为m阶简单图.论文得到了以下结果:(1)若H0为完全图的补图,则G[hn]的全色数为(n-1)m+1;(2)若H0为完全图,则G[hn]的全色数为mn;(3)若H0为二部图,则G[hn]的全色数为△(H0)+(n-1)m+1,其中A(H0)表示图H0的最大度;(4)若H0为m阶圈,m≥3,则G[hn]的全色数为(n-1)m+3.%Suppose that G is a wheel,or fan,or star with vertex set {t0,t1,…,tn-1 },where t0 is the vertex with maximum degree and n≥5.Let G[hn] be the generalized lexicographic product of graph G and a sequence of vertex disjoint graphs hn =(Hi)i∈{0,1,…,n-1},where each Hi is a simple graphs with m vertices.The following results are obtained:(1) If H0 is the complement of a complete graph,then the total chromatic number of graph G[hn] is (n-1)m+l;(2)If H0 is a complete graph,then the total chromatic number of graph G[hn] is mn;(3)If H0 is a bipartite graph,then the total chromatic number of graph G[hn] is A(H0)+(n-1)m+ 1,where A(H0) denotes the maximum degree of H0 ; (4)If H0 is a cycle,then the total chromatic number of graph G[hn] is (n-1)m+3.