Extended Results on Complementary Tree Domination Number and Chromatic Number of Graphs

For any graph G = (V,E) a subset D ⊆ V is a dominating set if every vertex in
V −D is adjacent to at least one vertex in D. A dominating set is said to be a complementary tree dominating set if the induced subgraph < V −D > is a tree. The minimum cardinality of a complementary tree dominating set is called the complementary tree domination number.