【摘要】 设G是一个简单图,i是一个正整数.X是V(G)的一个子集.如果X中任意两个点的距离都大于i,则称X是一个i-宽度箱.i叫做X的宽度.一个图G的泛宽度色数χρ(G)是使得G的顶点集V(G)被剖分成宽度两两不同的k个宽度箱的最小整数k.本文给出了轮,扇及图Kn的推广的haj s sum的泛宽度色数.更多还原

【Abstract】 Let G =(V(G),E(G)) be a simple graph,i be a positive integer.Then X■V(G) is a i-packing if the distances of any pairwise vertices of X are greater than i.The packing chromatic number χρ(G) of a graph G is the smallest integer k,which make the vertex set of G can be partitioned into k different packings.This paper presents the packing chromatic numbers of some special graphs.更多还原