Total Complementary Acyclic Domination in Graphs
M. Valliammal, S. P. Subbiah, V. Swaminathan · International Journal of Mathematics and Soft Computing · 2013
of G if for every v 2 V , there exists u 2 S such that u and v are adjacent. S is called a total complementary acyclic dominating set of G, if S is a total dominating set of G and hV − Si is acyclic. V (G) is a total complementary acyclic dominating set of G (since G has no isolates). The minimum cardinality of a total complementary acyclic dominating set of G is called the total complementary acyclic domination number of G and is denoted by t c−a(G). In this paper, characterization of graphs for which t c−a(G) takes specific values are found.