关于图的控制集划分
On the Partitions of the Dominating Set in Graphs

通过分类归纳的方法,对图的控制集划分问题进行了研究,给出了控制划分数d(G)和全控制划分数d1(G)的上界,并确定了d(Pm×Pn)的所有确切值和d(Cm×Pn)部分的确切值.
The problem of dominating set partition is studied by using the method of the partition and induction.An upper bound of domatic number d(G) and total domatic number dt(G) of G are given.And the all exact value of d(Pm×Pn) and partial exact value of d(Cm×Pn) are determined