Volume :8 , Issue :1 ,Page :17-23

Abstract : The concept of Complementary connected pe rfect domination number was introduced by G.Mahadevan et.alc., in [5]. A subs et S of V of a non trivial graph G is said to be complementary connected perfect dominating set if S is a dominating and is connected and has a perfect matching. The minimum cardinality taken over all complementary connected perfect dominating sets in G (CCPD-set) is called the co mplementary connected perfect do mination number of G and is denoted by ccp  . In [6, the authors already characteri zed the extremal graphs whose sum of complementary connected domination number an d chromatic number upto 2n-5. Since the characterization of extremal graphs whose sum of complementary connected domination number and chromatic number equals to 2n-6 for any n > 3