Complementary Tree Domination in Jahangir Graph J

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, results on complementary tree domination number , total complementary tree domination number and connected complementary tree in Jahangir graph J2,m are found