Complementary Tree Domination Number of a Graph
S. Muthammai, M. Bhanumathi, P. Vidhya · 2011
A set D of a graph G = (V,E) is a dominating set if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. A dominating set D is called a complementary tree dominating set if the induced sub graph is a tree. The minimum cardinality of a complementary tree dominating set is called the complementary tree domination number of G and is denoted by γctd(G). In this paper, bounds for γctd(G) and its exact values for some particular classes of graphs are found. Some results on complementary tree domination number are also established.