Abstract: A new method is given to prove the following conjecture posed by E.J, Cockayne and S.T. Hedetniemi. If the clique graph of a graph G is a bipartite graph, then the order of the smallest clique of G is less than or equal to the domatic number of G. And the relation between the domatic number and connectivity of a graph is discussed.