Further results on complementary perfect domination number of a graph
Gopalakrishnan Mahadevan, B. Ayisha · International Mathematical Forum · 2013
A subset S of V is called a dominating set in G if every vertex in v – S is adjacent to at least one vertex in S. The minimum cardinality taken over all dominating sets in G is called the dominating number of G is denoted by �.The conce[pt of complementary perfect domination number of a graph was introduced by Paulraj Joseph. J, Mahadeven. G, Selvam. A in [9]. A subset S of V of a non trivial graph G is said to be complementary perfect dominating set, if S is a dominating set and has a perfect matching. The minimum cardinality taken over all complementary perfect dominating sets is called complementary perfect domination