Complementary Acyclic Domination in Graphs
Let G = (V, E) be a graph. A set D ⊆ V is said to be a complementary acyclic dominating set if every vertex in V - D is adjacent to some vertex in D and the induced subgraph (V - D) has no cycles. In this paper, we initiate a study of complementary acyclic domination and relate the complementary acyclic domination number with other domination parameters.