Characterization of Complementary Connected Domination Number of a Graph
Maha Devan, A. Selvam Avadayappan, A. Mydeenbibi · International Journal of Mathematics and Soft Computing · 2012
A Set S A V is a complementary connected dominating set, if S is a dominating set of G and the induced subgraph is connected. The complementary connected domination number g 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 c . In this paper we characterize all cubic graphs on 8, 10, 12 vertices for which g cc = c =3 .