Characterization of complementary connected domination number of a graph

A set S ? V is a complementary connected dominating set if S is a dominating set of G and the induced subgraph< V - S > is connected. The complementary connected domination number ?cc(G) is the minimum cardinality taken over all complementary connected dominating sets in G. The chromatic number is the minimum number of colours required to colour all the vertices such that adjacent vertices do not receive the same colour and is denoted by?. In this paper we characterize all cubic graphs on 8, 10, 12 vertices for which ?cc=?=3.