CHROMATIC COMPLEMENTARY ACYCLIC DOMINATION IN GRAPHS
M. Valliammal, S. Subbiah, V. Swaminathan · International Journal of Pure and Apllied Mathematics · 2013
Let G =(V,E) be a simple graph. A subset D of V(G) is called a complementary acyclic dominating set (c-a dominating set) of G if D is a dominating set and is acyclic. D is called a chromatic comple- mentary acyclic dominating set (chromatic c-a dominating set) of G if D is a c-a dominating set and �( ) = �(G).The minimum cardinality of a chro- matic c-a dominating set of G is denoted bya (G) and is called chromatic c-a domination number of G.A study of chromatic c-a dominating sets has been made in detail in (5). In this paper, a study of chromatic c-a dominating sets is initiated.