中文摘要：

一个图G可均匀k-染色,如果它的点集可分为k个独立集合,使得每两个不同集合中点的数目最多差1。使这种染色存在的最小数k称为图G的均匀染色数,记作x=（G）。在本文中,得到了关于图K1,m□K1,n的均匀染色结果,2≤x=（K1,m□K1,n）≤4。

英文摘要：

A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differs by at most one.The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted X=（G）.In this paper,we obtain result on equitable coloring of K1,m□K1,n.2≤x=（K1,m□K1,n）≤4.